65 search results - page 1 / 13 » The Complexity of Nash Equilibria in Infinite Multiplayer Ga... |
FOSSACS
2008
Springer
13 years 6 months ago
2008
Springer
ICALP
2009
Springer
14 years 4 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...
CSL
2009
Springer
13 years 11 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
AAAI
2006
13 years 5 months ago
2006
We embark on an initial study of a new class of strategic (normal-form) games, so-called ranking games, in which the payoff to each agent solely depends on his position in a ranki...
ATAL
2007
Springer
13 years 10 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...