The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games

DOI10.1007/978-3-642-02930-1_25zbMath1248.91016arXiv0902.0101OpenAlexW1786478901MaRDI QIDQ3638102

Michael Ummels, Dominik Wojtczak

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0902.0101

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Stochastic games, stochastic differential games (91A15)

Related Items (5)

On Pure Nash Equilibria in Stochastic Games ⋮ Robust Equilibria in Mean-Payoff Games ⋮ The Complexity of Nash Equilibria in Limit-Average Games ⋮ Decision Problems for Nash Equilibria in Stochastic Games ⋮ Iterated Boolean games

This page was built for publication: The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games