Computational complexity of computing a quasi-proper equilibrium

DOI10.1007/978-3-030-86593-1_18MaRDI QIDQ2140505zbMATH OpenOpenAlexFDO

Authors Kristoffer Arnsfelt Hansen, Troels Bjerre Lund

Publication date 20 May 2022

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

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3078991 (Why is no real title available?)
• A relation between perfect equilibria in extensive form games and proper equilibria in normal form games
• An Inequality
• Bimatrix Equilibrium Points and Mathematical Programming
• Computing Normal Form Perfect Equilibria for Extensive Two-Person Games
• Computing a quasi-perfect equilibrium of a two-player game
• Efficient computation of equilibria for extensive two-person games
• Non-cooperative games
• On the Complexity of Nash Equilibria and Other Fixed Points
• On the complexity of the parity argument and other inefficient proofs of existence
• Reexamination of the perfectness concept for equilibrium points in extensive games
• Refinements of the Nash equilibrium concept
• Sequential Equilibria
• Smallest compact formulation for the permutahedron
• The complexity of approximating a trembling hand perfect equilibrium of a multi-player game in strategic form
• The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game
• The computational complexity of trembling hand perfection and other equilibrium refinements
• The real computational complexity of minmax value and equilibrium refinements in multi-player games
• Two examples of strategic equilibrium

Cited in

(1)

• On the polynomial time computation of equilibria for certain exchange economies

This page was built for publication: Computational complexity of computing a quasi-proper equilibrium

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