Sciweavers

1599 search results - page 96 / 320
» Algorithms for Parity Games
Sort
View
SIGECOM
2005
ACM
101views ECommerce» more  SIGECOM 2005»
15 years 12 months ago
Fairness and optimality in congestion games
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
Deeparnab Chakrabarty, Aranyak Mehta, Viswanath Na...
APPROX
2010
Springer
147views Algorithms» more  APPROX 2010»
15 years 8 months ago
Approximate Lasserre Integrality Gap for Unique Games
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
Subhash Khot, Preyas Popat, Rishi Saket
AAIM
2006
Springer
121views Algorithms» more  AAIM 2006»
16 years 12 days ago
Atomic Routing Games on Maximum Congestion
We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is t...
Costas Busch, Malik Magdon-Ismail
SBRN
2002
IEEE
15 years 11 months ago
Neural Connect 4 - A Connectionist Approach to the Game
This article presents the system “Neural Connect 4”, a program that plays the game Connect Four. This system employs the multilayer perceptron architecture which is learning t...
Marvin Oliver Schneider, João Luís G...
BIRTHDAY
2008
Springer
15 years 8 months ago
The Scholten/Dijkstra Pebble Game Played Straightly, Distributedly, Online and Reversed
The Scholten/Dijkstra "Pebble Game" is re-examined. We show that the algorithm lends itself to a distributed as well as an online version, and even to a reversed variant....
Wolfgang Reisig