A finite characterization of perfect equilibria

被引：0
|
作者：
Callejas, Ivonne [1 ]
Govindan, Srihari [2 ]
Pahl, Lucas [3 ]
机构：
[1] Georg August Univ Gottingen, Math Inst, Bunsenstr 3-5, D-37073 Gottingen, Germany
[2] Univ Rochester, Dept Econ, Rochester, NY 14627 USA
[3] Univ Bonn, Inst Microecon, Adenauerallee 24-42, D-53113 Bonn, Germany
来源：
MATHEMATICAL PROGRAMMING | 2024年 / 203卷 / 1-2期
关键词：
14F25; 9191; 91A68;
D O I：
10.1007/s10107-021-01746-8
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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.
引用
下载
收藏
页码：727 / 734
页数：8
相关论文
共 50 条
12345