Some Properties of the Nash Equilibrium in 2 × 2 Zero-Sum Games

11/16/2022
by   Ke Sun, et al.
0

In this report, some properties of the set of Nash equilibria (NEs) of 2 × 2 zero-sum games are reviewed. In particular, the cardinality of the set of NEs is given in terms of the entries of the payoff matrix. Moreover, closed-form expressions for the NE strategies and the payoff at the NE (the value of the game) are provided in terms of the entries of the payoff matrix. The results presented in this report are not necessarily new knowledge, as they follow from the definition of the NE after some tedious calculations. Nevertheless this synthetic presentation is original in the literature.

READ FULL TEXT
research
09/07/2019

Computing Stackelberg Equilibria of Large General-Sum Games

We study the computational complexity of finding Stackelberg Equilibria ...
research
04/29/2021

Computing Possible and Necessary Equilibrium Actions (and Bipartisan Set Winners)

In many multiagent environments, a designer has some, but limited contro...
research
01/10/2023

Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling

We give a quantum algorithm for computing an ϵ-approximate Nash equilibr...
research
01/31/2018

Graphon games

The study of strategic behavior in large scale networks via standard gam...
research
09/25/2020

Double Oracle Algorithm for Computing Equilibria in Continuous Games

Many efficient algorithms have been designed to recover Nash equilibria ...
research
08/03/2022

Additive Security Games: Structure and Optimization

In this work, we provide a structural characterization of the possible N...
research
08/24/2023

SC-PSRO: A Unified Strategy Learning Method for Normal-form Games

Solving Nash equilibrium is the key challenge in normal-form games with ...

Please sign up or login with your details

Forgot password? Click here to reset