Strategic decompositions of normal form games: Zero-sum games and potential games

被引:8
|
作者
Hwang, Sung-Ha [1 ]
Rey-Bellet, Luc [2 ]
机构
[1] Korea Adv Inst Sci & Technol KAIST, Coll Business, Seoul, South Korea
[2] Univ Massachusetts Amherst, Dept Math & Stat, Amherst, MA USA
基金
新加坡国家研究基金会; 美国国家科学基金会;
关键词
Decomposition; Zero-sum games; Potential games; NASH EQUILIBRIA; EXISTENCE; NUMBER;
D O I
10.1016/j.geb.2020.05.003
中图分类号
F [经济];
学科分类号
02 ;
摘要
We introduce new classes of games, called zero-sum equivalent games and zero-sum equivalent potential games, and prove decomposition theorems involving these classes of games. Two games are "strategically equivalent" if, for every player, the payoff differences between two strategies (holding other players' strategies fixed) are identical. A zero-sum equivalent game is a game that is strategically equivalent to a zero-sum game; a zero-sum equivalent potential game is a potential game that is strategically equivalent to a zero-sum game. We also call a game "normalized" if the sum of one player's payoffs, given the other players' strategies, is zero. One of our main decomposition results shows that any normal form game, whether the strategy set is finite or continuous, can be uniquely decomposed into a zero-sum normalized game, a zero-sum equivalent potential game, and an identical interest normalized game, each with distinctive equilibrium properties. (C) 2020 Elsevier Inc. All rights reserved.
引用
收藏
页码:370 / 390
页数:21
相关论文
共 50 条
  • [21] A Note on Dynamic Zero-sum Games
    Zhang, Xiao-yan
    CCDC 2009: 21ST CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-6, PROCEEDINGS, 2009, : 4758 - 4760
  • [22] On the complexity of succinct zero-sum games
    Fortnow, Lance
    Impagliazzo, Russell
    Kabanets, Valentine
    Umans, Christopher
    COMPUTATIONAL COMPLEXITY, 2008, 17 (03) : 353 - 376
  • [23] On the complexity of succinct zero-sum games
    Fortnow, L
    Impagliazzo, R
    Kabanets, V
    Umans, C
    TWENTIETH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2005, : 323 - 332
  • [24] Definable Zero-Sum Stochastic Games
    Bolte, Jerome
    Gaubert, Stephane
    Vigeral, Guillaume
    MATHEMATICS OF OPERATIONS RESEARCH, 2015, 40 (01) : 171 - 191
  • [25] Zero-Sum Stochastic Stackelberg Games
    Goktas, Denizalp
    Zhao, Jiayi
    Greenwald, Amy
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [26] Strategy investments in zero-sum games
    Garcia, Raul
    Hosseinian, Seyedmohammadhossein
    Pai, Mallesh
    Schaefer, Andrew J.
    OPTIMIZATION LETTERS, 2024, : 1771 - 1789
  • [27] On the Complexity of Succinct Zero-Sum Games
    Lance Fortnow
    Russell Impagliazzo
    Valentine Kabanets
    Christopher Umans
    computational complexity, 2008, 17 : 353 - 376
  • [28] Convexity in zero-sum differential games
    Goebel, R
    PROCEEDINGS OF THE 41ST IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-4, 2002, : 3964 - 3969
  • [29] THE COMPLEXITY OF 2-PERSON ZERO-SUM GAMES IN EXTENSIVE FORM
    KOLLER, D
    MEGIDDO, N
    GAMES AND ECONOMIC BEHAVIOR, 1992, 4 (04) : 528 - 552
  • [30] Information spillover in multiple zero-sum games
    Pahl, Lucas
    INTERNATIONAL JOURNAL OF GAME THEORY, 2024, 53 (01) : 71 - 104