Decision Problems for Nash Equilibria in Stochastic Games

DOI10.1007/978-3-642-04027-6_37zbMath1257.91007arXiv0904.3325OpenAlexW2127182849MaRDI QIDQ3644770

Dominik Wojtczak, Michael Ummels

Publication date: 12 November 2009

Published in: Computer Science Logic (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) (n)-person games, (n>2) (91A06) Stochastic games, stochastic differential games (91A15)

Related Items

Iterated Boolean games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of stochastic games
• The complexity of computing a Nash equilibrium
• Multi-Objective Model Checking of Markov Decision Processes
• The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
• On the Complexity of Numerical Analysis
• The determinacy of Blackwell games
• The complexity of probabilistic verification
• Markov decision processes and regular events
• On the synthesis of strategies in infinite games
• Computer Science Logic
• Computer Science Logic
• The Complexity of Nash Equilibria in Infinite Multiplayer Games
• Mathematical Foundations of Computer Science 2005
• Automata, Languages and Programming
• Equilibrium points in n -person games