Computing proper equilibria of zero-sum games

被引：0
|
作者：
Miltersen, Peter Bro [1 ]
Sorensen, Troels Bjerre [1 ]
机构：
[1] Univ Aarhus, Dept Comp Sci Daimi, DK-8000 Aarhus C, Denmark
来源：
COMPUTERS AND GAMES | 2007年 / 4630卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We show that a proper equilibrium of a matrix game can be found in polynomial time by solving a linear (in the number of pure strategies of the two players) number of linear programs of roughly the same dimensions as the standard linear programs describing the Nash equilibria of the game.
引用
收藏
页码：200 / +
页数：3
相关论文
共 50 条
  • [41] Definable Zero-Sum Stochastic Games
    Bolte, Jerome
    Gaubert, Stephane
    Vigeral, Guillaume
    MATHEMATICS OF OPERATIONS RESEARCH, 2015, 40 (01) : 171 - 191
  • [42] Zero-Sum Stochastic Stackelberg Games
    Goktas, Denizalp
    Zhao, Jiayi
    Greenwald, Amy
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [43] On the Complexity of Succinct Zero-Sum Games
    Lance Fortnow
    Russell Impagliazzo
    Valentine Kabanets
    Christopher Umans
    computational complexity, 2008, 17 : 353 - 376
  • [44] Convexity in zero-sum differential games
    Goebel, R
    PROCEEDINGS OF THE 41ST IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-4, 2002, : 3964 - 3969
  • [45] Computing Ex Ante Coordinated Team-Maxmin Equilibria in Zero-Sum Multiplayer Extensive-Form Games
    Zhang, Youzhi
    An, Bo
    Cerny, Jakub
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 5813 - 5821
  • [46] Zero-sum problems and coverings by proper cosets
    Gao, WD
    Geroldinger, A
    EUROPEAN JOURNAL OF COMBINATORICS, 2003, 24 (05) : 531 - 549
  • [47] Zero-sum Polymatrix Markov Games: Equilibrium Collapse and Efficient Computation of Nash Equilibria
    Kalogiannis, Fivos
    Panageas, Ioannis
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [48] Minimizing Regret on Reflexive Banach Spaces and Nash Equilibria in Continuous Zero-Sum Games
    Balandat, Maximilian
    Krichene, Walid
    Tomlin, Claire
    Bayen, Alexandre
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 29 (NIPS 2016), 2016, 29
  • [49] Policy Optimization Provably Converges to Nash Equilibria in Zero-Sum Linear Quadratic Games
    Zhang, Kaiqing
    Yang, Zhuoran
    Basar, Tamer
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
  • [50] Practical Performance of Refinements of Nash Equilibria in Extensive-Form Zero-Sum Games
    Cermak, Jiri
    Bosansky, Branislav
    Lisy, Viliam
    21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 : 201 - +
12345