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.












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)