42 citations · 185 across the 35 of their papers we have counts for
Showing 2009Show all
3 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★ 1 cited
One-Counter Markov Decision Processes
Tomáš Brázdil, Václav Brožek, Kousha Etessami +2
We study the computational complexity of central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. OC-MDPs…
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…