Sciweavers

ICALP
2009
Springer
14 years 11 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 fal...
Michael Ummels, Dominik Wojtczak