Game theory of undirected graphical models
<|reference_start|>Game theory of undirected graphical models: An $n$-player game $X$ in normal form can be modeled via undirected discrete graphical models where the discrete random variables represent the players and their state spaces are the set of pure strategies. There exists an edge between the vertices of the graphical model whenever there is a dependency between the associated players. We study the Spohn conditional independence (CI) variety $\mathcal{V}_{X,\mathcal{C}}$, which is the intersection of the independence model $\mathcal{M}_{\mathcal{C}}$ with the Spohn variety of the game $X$. We prove a conjecture by the first author and Sturmfels that $\mathcal{V}_{X,\mathcal{C}}$ is of codimension $n$ in $\mathcal{M}_{\mathcal{C}}$ for a generic game $X$ with binary choices. We show that the set of totally mixed CI equilibria i.e., the restriction of the Spohn CI variety to the open probability simplex is a smooth semialgebraic manifold for a generic game $X$ with binary choices. If the undirected graph is a disjoint union of cliques, we analyze certain algebro-geometric features of Spohn CI varieties and prove affine universality theorems.<|reference_end|>
@article{portakal2024game,
    title={Game theory of undirected graphical models},
    author={Irem Portakal and Javier Sendra-Arranz},
    journal={arXiv preprint arXiv:2402.13246},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.13246},
    primaryClass={math.AG cs.GT}
}