3 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.GT2008
Trembling hand perfection is NP-hard
Peter Bro Miltersen
It is NP-hard to decide if a given pure-strategy Nash equilibrium of a given three-player game in strategic form with integer payoffs is trembling hand perfect.
cs.GT2008★ 3 cited
On the computational complexity of solving stochastic mean-payoff games
Vladimir Gurvich, Peter Bro Miltersen
We consider some well-known families of two-player, zero-sum, perfect information games that can be viewed as special cases of Shapley's stochastic games. We show that the followin…
cs.GT2008★ 2 cited
Approximability and parameterized complexity of minmax values
Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen +1
We consider approximating the minmax value of a multi-player game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with a precis…