48 citations · 205 across the 8 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
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…
cs.LO2011★ 38 cited
Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
Patricia Bouyer, Nicolas Markey, Jörg Olschewski +1
We study nondeterministic strategies in parity games with the aim of computing a most permissive winning strategy. Following earlier work, we measure permissiveness in terms of the…