A finite characterization of perfect equilibria
2021-12-14 | journal article. A publication with affiliation to the University of Göttingen.
Jump to: Cite & Linked | Documents & Media | Details | Version history
Documents & Media
Details
- Authors
- Callejas, Ivonne; Govindan, Srihari; Pahl, Lucas
- Abstract
- 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.
- Issue Date
- 14-December-2021
- Journal
- Mathematical Programming
- Organization
- Mathematisches Institut
- ISSN
- 0025-5610
- eISSN
- 1436-4646
- Language
- English
- Sponsor
- Rheinische Friedrich-Wilhelms-Universität Bonn (1040)
