scientific article; zbMATH DE number 7559416
From MaRDI portal
Publication:5089213
DOI10.4230/LIPIcs.MFCS.2020.45MaRDI QIDQ5089213
Kristoffer Arnsfelt Hansen, Steffan Christ Sølvsten
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2006.08314
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fixed points, Nash equilibria, and the existential theory of the reals
- Exotic quantifiers, complexity classes, and complete problems
- Pure subgame-perfect equilibria in free transition games
- Positional strategies for mean payoff games
- Nash and correlated equilibria: Some complexity considerations
- Stay-in-a-set games
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
- A three-person deterministic graphical game without Nash equilibria
- Non-cooperative games
- Realizability of Graphs and Linkages
- On Pure Nash Equilibria in Stochastic Games
- Mixed Nash Equilibria in Concurrent Terminal-Reward Games
- On the Complexity of Nash Equilibria and Other Fixed Points
- The Complexity of Nash Equilibria in Limit-Average Games
- The Complexity of Nash Equilibria in Stochastic Multiplayer Games
- ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria
- A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games.
- Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- The Complexity of Computing a Nash Equilibrium
- Computer Science Logic
- On the computational complexity of decision problems about multi-player Nash equilibria
- The real computational complexity of minmax value and equilibrium refinements in multi-player games
This page was built for publication:
