48 citations · 205 across the 8 of their papers we have counts for
4 papers · 1 filter
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…
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…
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…
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…