48 citations · 205 across the 8 of their papers we have counts for
Showing 2011 · cs.GTShow all
2 papers · 2 filters
cs.GT2011★ 22 cited
The Complexity of Nash Equilibria in Limit-Average Games
Michael Ummels, Dominik Wojtczak
We study the computational complexity of Nash equilibria in concurrent games with limit-average objectives. In particular, we prove that the existence of a Nash equilibrium in rand…
cs.GT2011★ 42 cited
The Complexity of Nash Equilibria in Stochastic Multiplayer Games
Michael Ummels, Dominik Wojtczak
We analyse the computational complexity of finding Nash equilibria in turn-based stochastic multiplayer games with omega-regular objectives. We show that restricting the search spa…