The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements

DOI10.1007/978-3-642-16170-4_18zbMath1310.91014OpenAlexW3137859489MaRDI QIDQ3162519

Troels Bjerre Sørensen, Peter Bro Miltersen, Kristoffer Arnsfelt Hansen

Publication date: 19 October 2010

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16170-4_18

Mathematics Subject Classification ID

Noncooperative games (91A10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Computational complexity of computing a quasi-proper equilibrium, A differentiable path-following algorithm for computing perfect stationary points, A characterization of quasi-perfect equilibria, An extension of quantal response equilibrium and determination of perfect equilibrium, A differentiable homotopy method to compute perfect equilibria, The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game, The real computational complexity of minmax value and equilibrium refinements in multi-player games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
• A relation between perfect equilibria in extensive form games and proper equilibria in normal form games
• The computational complexity of evolutionarily stable strategies
• Acceptable and predominant correlated equilibria
• Strategy subsets closed under rational behavior
• Reexamination of the perfectness concept for equilibrium points in extensive games
• Independence on relative probability spaces and consistent assessments in game trees
• Perfect equilibrium and lexicographic beliefs
• Two examples of strategic equilibrium
• Efficient computation of equilibria for extensive two-person games
• The complexity of computing a Nash equilibrium
• Lexicographic Probabilities and Equilibrium Refinements
• Algorithms for Closed Under Rational Behavior (CURB) Sets
• Sequential Equilibria
• On the combinatorial and algebraic complexity of quantifier elimination
• Automata, Languages and Programming