Totally mixed conditional independence equilibria of generic games
By: Matthieu Bouyer, Irem Portakal, Javier Sendra-Arranz
Potential Business Impact:
Finds hidden patterns in games for smarter choices.
This paper further develops the algebraic--geometric foundations of conditional independence (CI) equilibria, a refinement of dependency equilibria that integrates conditional independence relations from graphical models into strategic reasoning and thereby subsumes Nash equilibria. Extending earlier work on binary games, we analyze the structure of the associated Spohn CI varieties for generic games of arbitrary format. We show that for generic games the Spohn CI variety is either empty or has codimension equal to the sum of the players' strategy dimensions minus the number of players in the parametrized undirected graphical model. When non-empty, the set of totally mixed CI equilibria forms a smooth manifold for generic games. For cluster graphical models, we introduce the class of Nash CI varieties, prove their irreducibility, and describe their defining equations, degrees, and conditions for the existence of totally mixed CI equilibria for generic games.
Similar Papers
Branch-and-Cut for Computing Approximate Equilibria of Mixed-Integer Generalized Nash Games
CS and Game Theory
Finds fair solutions for complex games.
The Complexity of Correlated Equilibria in Generalized Games
CS and Game Theory
Makes finding game winners harder for computers.
A vector bundle approach to Nash equilibria
CS and Game Theory
Finds all possible winning strategies in games.