On Pure Nash Equilibria in Stochastic Games
From MaRDI portal
Publication:2948480
DOI10.1007/978-3-319-17142-5_31zbMath1461.91029MaRDI QIDQ2948480
Ankush Das, Lakshmi Manasa, Ashutosh Trivedi, Dominik Wojtczak, Shankara Narayanan Krishna
Publication date: 30 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-17142-5_31
Related Items
Cites Work
- New complexity results about Nash equilibria
- Mixed Nash Equilibria in Concurrent Terminal-Reward Games
- The Complexity of Nash Equilibria in Limit-Average Games
- Settling the complexity of computing two-player Nash equilibria
- The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
- The Complexity of Computing a Nash Equilibrium
- Computer Science Logic
- The Complexity of Nash Equilibria in Infinite Multiplayer Games
- Equilibrium points in n -person games
- Unnamed Item
- Unnamed Item
- Unnamed Item