Coarse Correlated Equilibrium Implies Nash Equilibrium in Two-Player Zero-Sum Games

04/14/2023
by   Revan MacQueen, et al.
0

We give a simple proof of the well-known result that the marginal strategies of a coarse correlated equilibrium form a Nash equilibrium in two-player zero-sum games. A corollary of this fact is that no-external-regret learning algorithms that converge to the set of coarse correlated equilibria will also converge to Nash equilibria in two-player zero-sum games. We show an approximate version: that ϵ-coarse correlated equilibria imply 2ϵ-Nash equilibria.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/23/2023

Zero-sum Polymatrix Markov Games: Equilibrium Collapse and Efficient Computation of Nash Equilibria

The works of (Daskalakis et al., 2009, 2022; Jin et al., 2022; Deng et a...
research
03/22/2022

Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games

We show that, for any sufficiently small fixed ϵ > 0, when both players ...
research
09/07/2019

Computing Stackelberg Equilibria of Large General-Sum Games

We study the computational complexity of finding Stackelberg Equilibria ...
research
12/20/2014

On the robustness of learning in games with stochastically perturbed payoff observations

Motivated by the scarcity of accurate payoff feedback in practical appli...
research
12/04/2017

On the Geometry of Nash and Correlated Equilibria with Cumulative Prospect Theoretic Preferences

It is known that the set of all correlated equilibria of an n-player non...
research
07/18/2022

A Deep Reinforcement Learning Approach for Finding Non-Exploitable Strategies in Two-Player Atari Games

This paper proposes novel, end-to-end deep reinforcement learning algori...
research
07/21/2020

Smoothed Complexity of 2-player Nash Equilibria

We prove that computing a Nash equilibrium of a two-player (n × n) game ...

Please sign up or login with your details

Forgot password? Click here to reset