ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a (2×n)(2\times n)-game with generic payoff matrices, and let PGP_G be its correlated equilibrium polytope. A polytope is full-dimensional when it has maximal dimension in its ambient correlated equilibrium space.

Smaller-game conjecture. If PGP_G is not of maximal dimension, then there exists a (2×k)(2\times k)-game G′G' with k<nk<n such that PG′P_{G'} has maximal dimension and PGP_G and PG′P_{G'} are combinatorially equivalent.

For (2×3)(2\times 3)-games, the preceding results establish the corresponding reduction to smaller games, and computations support the claim for (2×n)(2\times n)-games with n≤5n\leq 5. The conjecture predicts that every non-maximal correlated equilibrium polytope in this family has the combinatorial type of a maximal polytope arising from a smaller game.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.