48 citations · 205 across the 8 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.GT2009★ 9 cited
Decision Problems for Nash Equilibria in Stochastic Games
Michael Ummels, Dominik Wojtczak
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with -regular objectives. While the existence of an equilibrium whose payoff f…
cs.GT2009★ 17 cited
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
Michael Ummels, Dominik Wojtczak
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…