A Finite Characterization of Perfect Equilibria
Theoretical Economics
2021-11-03 v1 Computer Science and Game Theory
Algebraic Geometry
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.
Keywords
Cite
@article{arxiv.2111.01638,
title = {A Finite Characterization of Perfect Equilibria},
author = {Ivonne Callejas and Srihari Govindan and Lucas Pahl},
journal= {arXiv preprint arXiv:2111.01638},
year = {2021}
}