60 search results - page 8 / 12 » Algorithms for pure Nash equilibria in weighted congestion g... |
WINE
2009
Springer
14 years 2 months ago
2009
Springer
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
SODA
2010
ACM
13 years 5 months ago
2010
ACM
We consider computational aspects of alternating move games, repeated games in which players take actions at alternating time steps rather than playing simultaneously. We show tha...
TSP
2008
13 years 7 months ago
2008
In this two-part paper, we propose a decentralized strategy, based on a game-theoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipoint-to-mult...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...