Combinatorics of Correlated Equilibria

We study the correlated equilibrium polytope P_G of a game G from a combinatorial point of view. We introduce the region of full-dimensionality for this class of polytopes, and prove that it is a semialgebraic set for any game. Through the use of the oriented matroid strata, we propose a structured method for describing the possible combinatorial types of P_G, and show that for (2 × n)-games, the algebraic boundary of each stratum is the union of coordinate hyperplanes and binomial hypersurfaces. Finally, we provide a computational proof that there exists a unique combinatorial type of maximal dimension for (2 × 3)-games.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/12/2020

Computational Hardness of Multidimensional Subtraction Games

We study algorithmic complexity of solving subtraction games in a fixed ...
research
07/13/2022

A Simple Adaptive Procedure Converging to Forgiving Correlated Equilibria

Simple adaptive procedures that converge to correlated equilibria are kn...
research
09/11/2023

Constrained Correlated Equilibria

This paper introduces constrained correlated equilibrium, a solution con...
research
04/14/2021

On the Vapnik-Chervonenkis dimension of products of intervals in ℝ^d

We study combinatorial complexity of certain classes of products of inte...
research
09/12/2021

Nimber-Preserving Reductions and Homomorphic Sprague-Grundy Game Encodings

The concept of nimbers–a.k.a. Grundy-values or nim-values–is fundamental...
research
10/17/2022

Turbocharging Solution Concepts: Solving NEs, CEs and CCEs with Neural Equilibrium Solvers

Solution concepts such as Nash Equilibria, Correlated Equilibria, and Co...
research
03/09/2023

Infinitely many absolute universes

Absolute combinatorial game theory was recently developed as a unifying ...

Please sign up or login with your details

Forgot password? Click here to reset