Bayesian Action-Graph Games

Games of incomplete information, or Bayesian games, are an important game-theoretic model and have many applications in economics. We propose Bayesian action-graph games (BAGGs), a novel graphical representation for Bayesian games. BAGGs can represent arbitrary Bayesian games, and furthermore can compactly express Bayesian games exhibiting commonly encountered types of structure including symmetry, action- and type-specific utility independence, and probabilistic independence of type distributions. We provide an algorithm for computing expected utility in BAGGs, and discuss conditions under which the algorithm runs in polynomial time. Bayes-Nash equilibria of BAGGs can be computed by adapting existing algorithms for complete-information normal form games and leveraging our expected utility algorithm. We show both theoretically and empirically that our approaches improve significantly on the state of the art.

[1]  Kevin Leyton-Brown,et al.  Action-Graph Games , 2011, Games Econ. Behav..

[2]  Robert Wilson,et al.  Structure theorems for game trees , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Michael L. Littman,et al.  Graphical Models for Game Theory , 2001, UAI.

[4]  Kevin Leyton-Brown,et al.  Computing Nash Equilibria of Action-Graph Games , 2004, UAI.

[5]  Paul W. Goldberg,et al.  Reducibility among equilibrium problems , 2006, STOC '06.

[6]  John C. Harsanyi,et al.  Games with Incomplete Information Played by "Bayesian" Players, I-III: Part I. The Basic Model& , 2004, Manag. Sci..

[7]  Kevin Leyton-Brown,et al.  A Polynomial-Time Algorithm for Action Graph Games , 2006, AAAI.

[8]  Frans A. Oliehoek,et al.  Heuristic search for identical payoff Bayesian games , 2010, AAMAS.

[9]  Paul W. Goldberg,et al.  The complexity of computing a Nash equilibrium , 2006, STOC '06.

[10]  Robert W. Rosenthal,et al.  Bayesian Equilibria of Finite Two-Person Games with Incomplete Information , 1974 .

[11]  Kevin Leyton-Brown,et al.  Temporal Action-Graph Games: A New Representation for Dynamic Games , 2009, UAI.

[12]  A. Talman,et al.  Simplicial variable dimension algorithms for solving the nonlinear complementarity problem on a product of unit simplices using a general labelling , 1987 .

[13]  Daphne Koller,et al.  Multi-Agent Influence Diagrams for Representing and Solving Games , 2001, IJCAI.

[14]  Robert Wilson,et al.  A global Newton method to compute Nash equilibria , 2003, J. Econ. Theory.

[15]  Toni Mancini,et al.  Complexity of Pure Equilibria in Bayesian Games , 2007, IJCAI.

[16]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[17]  Yoav Shoham,et al.  Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .

[18]  Christos H. Papadimitriou,et al.  Computing Equilibria in Anonymous Games , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[19]  Michael P. Wellman,et al.  Computing approximate bayes-nash equilibria in tree-games of incomplete information , 2004, EC '04.

[20]  Andrew McLennan,et al.  Gambit: Software Tools for Game Theory , 2006 .

[21]  Xiaotie Deng,et al.  Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[22]  David Heckerman,et al.  Causal independence for probability assessment and inference using Bayesian networks , 1996, IEEE Trans. Syst. Man Cybern. Part A.

[23]  Michael P. Wellman,et al.  Computing Best-Response Strategies in Infinite Games of Incomplete Information , 2004, UAI.