scientific article; zbMATH DE number 7559416

DOI10.4230/LIPICS.MFCS.2020.45MaRDI QIDQ5089213zbMATH OpenFDO

Authors Kristoffer Arnsfelt Hansen, Steffan Christ Sølvsten

Publication date 18 July 2022

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

zbMATH Keywords

existential theory of the realsperfect information stochastic gamesstationary Nash equilibrium

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• \(\exists\mathbb{R}\)-complete decision problems about symmetric Nash equilibria in symmetric multi-player games
• A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games.
• A stay-in-a-set game without a stationary equilibrium
• A three-person deterministic graphical game without Nash equilibria
• Computer Science Logic
• ETR-completeness for decision versions of multi-player (symmetric) Nash equilibria
• Exotic quantifiers, complexity classes, and complete problems
• Fixed points, Nash equilibria, and the existential theory of the reals
• scientific article; zbMATH DE number 3128726 (Why is no real title available?)
• scientific article; zbMATH DE number 3128733 (Why is no real title available?)
• scientific article; zbMATH DE number 3084669 (Why is no real title available?)
• Mixed Nash equilibria in concurrent terminal-reward games
• Nash and correlated equilibria: Some complexity considerations
• Non-cooperative games
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
• On pure Nash equilibria in stochastic games
• On the Complexity of Nash Equilibria and Other Fixed Points
• On the computational complexity of decision problems about multi-player Nash equilibria
• Positional strategies for mean payoff games
• Pure subgame-perfect equilibria in free transition games
• Realizability of graphs and linkages
• Stay-in-a-set games
• The complexity of computing a Nash equilibrium
• The Complexity of Nash Equilibria in Limit-Average Games
• The complexity of Nash equilibria in stochastic multiplayer games
• The real computational complexity of minmax value and equilibrium refinements in multi-player games

Cited in

(3)

• On Nash equilibrium solutions in nonzero-sum stochastic games with complete information
• On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost
• -stationary Nash equilibria in multi-player stochastic graph games

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089213)