Computational complexity of multi-player evolutionarily stable strategies

DOI10.1007/978-3-030-79416-3_1OpenAlexW3176430832MaRDI QIDQ2117070

Kristoffer Arnsfelt Hansen, Manon Blanc

Publication date: 21 March 2022

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

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

The complexity of the Hausdorff distance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fixed points, Nash equilibria, and the existential theory of the reals
• Evolutionary stable strategies and game dynamics for \(n\)-person games
• The computational complexity of evolutionarily stable strategies
• New complexity results about Nash equilibria
• Exotic quantifiers, complexity classes, and complete problems
• Nash and correlated equilibria: Some complexity considerations
• Evolutionarily stable strategies and game dynamics
• Multi-player matrix games
• \(\forall\exists\mathbb {R}\)-completeness and area-universality
• Non-cooperative games
• Realizability of Graphs and Linkages
• The Exact Computational Complexity of Evolutionarily Stable Strategies
• On the Complexity of Quantifier Elimination: the Structural Approach
• ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria
• Complexity of Some Geometric and Topological Problems
• On the Complexity of Numerical Analysis
• Accessible telephone directories
• 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 digital nondeterminism
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Evolutionary Game Theory: A Generalization of the ESS Definition
• The art gallery problem is ∃ ℝ-complete
• The Logic of Animal Conflict
• 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
• Dot operators