35 search results - page 4 / 7 » Computing pure strategy nash equilibria in compact symmetric... |
CG
2006
Springer
15 years 1 months ago
2006
Springer
We show that a proper equilibrium of a matrix game can be found in polynomial time by solving a linear (in the number of pure strategies of the two players) number of linear progra...
SODA
2010
ACM
14 years 7 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...
101
click to vote
MOBIHOC
2012
ACM
12 years 12 months ago
2012
ACM
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
We study the relationship between the social cost of correlated equilibria and the social cost of Nash equilibria. In contrast to previous work focusing on the possible benefits ...
FOCS
2006
IEEE
15 years 3 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...