15 search results - page 1 / 3 » The Complexity of Nash Equilibria in Simple Stochastic Multi... |
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 6 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...
FOSSACS
2008
Springer
13 years 6 months ago
2008
Springer
CORR
2008
Springer
13 years 4 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...