Sciweavers

Share
ICALP
2009
Springer

The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games

9 years 3 months ago
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
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 fall into a certain interval may lead to undecidability. In particular, we prove that the following problem is undecidable: Given a game G, does there exist a pure-strategy Nash equilibrium of G where player 0 wins with probabil
Michael Ummels, Dominik Wojtczak
Added 03 Dec 2009
Updated 03 Dec 2009
Type Conference
Year 2009
Where ICALP
Authors Michael Ummels, Dominik Wojtczak
Comments (0)
books