Strategic Decompositions of Normal Form Games: Zero-sum Games and Potential Games
Not on the map. Why?
Abstract (arXiv)
We study new classes of games, called zero-sum equivalent games and zero-sum equivalent potential games, and prove decomposition theorems involving these classes of games. We say that 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 zero-sum equivalent game that is strategically equivalent to a common interest game. We also call a game "normalized" if the sum of one player's payoffs, given the other players' strategies, is always zero. We show that any normal form game can be uniquely decomposed into either (i) a zero-sum equivalent game and a normalized common interest game, or (ii) a zero-sum equivalent potential game, a normalized zero-sum game, and a normalized common interest game, each with distinctive equilibrium properties. For example, we show that two-player zero-sum equivalent games with finite strategy sets generically have a unique Nash equilibrium and that two-player zero-sum equivalent potential games with finite strategy sets generically have a strictly dominant Nash equilibrium.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 22 Feb 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 2.
5 papers.
- 2024GameVLM: A Decision-making Framework for Robotic Task Planning Based on Visual Language Models and Zero-sum Gamescited by 7
- 2024A geometric decomposition of finite games: Convergence vs. recurrence under exponential weightscited by 4
- 2022On the Convergence of Fictitious Play: A Decomposition Approachcited by 2
- 2023Tackling Cyberattacks through AI-based Reactive Systems: A Holistic Review and Future Visioncited by 2
- 2021Consensus Multiplicative Weights Update: Learning to Learn using Projector-based Game Signaturescited by 1
- 2024GameVLM: A Decision-making Framework for Robotic Task Planning Based on Visual Language Models and Zero-sum Games22 May 2024
- 2024A geometric decomposition of finite games: Convergence vs. recurrence under exponential weights12 May 2024
- 2023Tackling Cyberattacks through AI-based Reactive Systems: A Holistic Review and Future Vision11 Dec 2023
- 2022On the Convergence of Fictitious Play: A Decomposition Approach3 May 2022
- 2021Consensus Multiplicative Weights Update: Learning to Learn using Projector-based Game Signatures4 Jun 2021