A finite characterization of perfect equilibria
From MaRDI portal
Abstract: Govindan and Klumpp [7] provided a characterization of perfect equilibria using Lexicographic Probability Systems (LPSs). Their characterization was essentially finite in that they showed that there exists a finite bound on the number of levels in the LPS, but they did not compute it explicitly. In this note, we draw on two recent developments in Real Algebraic Geometry to obtain a formula for this bound.
Recommendations
- Perfect equilibrium and lexicographic beliefs
- Lexicographic Probabilities and Equilibrium Refinements
- A nonstandard characterization of sequential equilibrium, perfect equilibrium, and proper equilibrium
- The Algebraic Geometry of Perfect and Sequential Equilibrium
- Existence of perfect equilibria: a direct proof
Cites work
- Finding all Nash equilibria of a finite game using polynomial algebra
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- Lectures on Resolution of Singularities (AM-166)
- Lexicographic Probabilities and Equilibrium Refinements
- Non-cooperative games
- On the Strategic Stability of Equilibria
- Perfect equilibrium and lexicographic beliefs
- Reexamination of the perfectness concept for equilibrium points in extensive games
- Refinements of the Nash equilibrium concept
- Separation of real algebraic sets and the Łojasiewicz exponent
- The Algebraic Geometry of Perfect and Sequential Equilibrium
Cited in
(1)
This page was built for publication: A finite characterization of perfect equilibria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6120901)