A finite characterization of perfect equilibria
成果类型：
Article
署名作者：
Callejas, Ivonne; Govindan, Srihari; Pahl, Lucas
署名单位：
University of Gottingen; University of Rochester; University of Bonn
刊物名称：
MATHEMATICAL PROGRAMMING
ISSN/ISSBN：
0025-5610
DOI：
10.1007/s10107-021-01746-8
发表日期：
2024
页码：
727-734
关键词：
摘要：
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.