142 search results - page 2 / 29 » Computing Nash Equilibria: Approximation and Smoothed Comple... |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
WINE
2007
Springer
13 years 11 months ago
2007
Springer
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ï¬...
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
ICALP
2009
Springer
14 years 5 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...
SIGECOM
2006
ACM
13 years 11 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...