119 search results - page 8 / 24 » The complexity of pure Nash equilibria |
84
Voted
TCS
2008
14 years 9 months ago
2008
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
74
Voted
FOCS
2007
IEEE
15 years 3 months ago
2007
IEEE
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentia...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We present an algorithm to compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with a fixed structure. Using this representatio...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
A growing body of literature in networked systems research relies on game theory and mechanism design to model and address the potential lack of cooperation between self-intereste...
88
Voted
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
We study the number of steps required to reach a pure Nash Equilibrium in a load balancing scenario where each job behaves selfishly and attempts to migrate to a machine which will...