English

Geometry of Dependency Equilibria

Algebraic Geometry 2022-05-31 v2 Computer Science and Game Theory

Abstract

An nn-person game is specified by nn tensors of the same format. We view its equilibria as points in that tensor space. Dependency equilibria are defined by linear constraints on conditional probabilities, and thus by determinantal quadrics in the tensor entries. These equations cut out the Spohn variety, named after the philosopher who introduced dependency equilibria. The Nash equilibria among these are the tensors of rank one. We study the real algebraic geometry of the Spohn variety. This variety is rational, except for 2×22 \times 2 games, when it is an elliptic curve. For 3×23 \times 2 games, it is a del Pezzo surface of degree two. We characterize the payoff regions and their boundaries using oriented matroids, and we develop the connection to Bayesian networks in statistics.

Keywords

Cite

@article{arxiv.2201.05506,
  title  = {Geometry of Dependency Equilibria},
  author = {Irem Portakal and Bernd Sturmfels},
  journal= {arXiv preprint arXiv:2201.05506},
  year   = {2022}
}

Comments

20 pages, to appear in Rendiconti dell'Istituto di Matematica dell'Universit\`a di Trieste

R2 v1 2026-06-24T08:50:15.376Z