55 search results - page 2 / 11 » Settling the Complexity of Computing Two-Player Nash Equilib... |
CG
2006
Springer
14 years 7 days 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...
JUCS
2010
13 years 3 months ago
2010
Abstract: We investigate the Weihrauch-degree of several solution concepts from noncooperative game theory. While the consideration of Nash equilibria forms the core of our work, a...
SIROCCO
2008
13 years 10 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...