Ordinal Graph-Based Games

The graphical, hypergraphical and polymatrix games frameworks provide concise representations of non-cooperative normal-form games involving many agents. In these graph-based games, agents interact in simultaneous local subgames with the agents which are their neighbors in a graph. Recently, ordinal normal form games have been proposed as a framework for game theory where agents’ utilities are ordinal. This paper presents the first definition of Ordinal Graphical Games (OGG), Ordinal Hypergraphical Games (OHG), and Ordinal Polymatrix Games (OPG). We show that, as for classical graph-based games, determining whether a pure NE exists is also NP-hard. We propose an original CSP model to decide their existence and compute them. Then, a polynomial-time algorithm to compute possibilistic mixed equilibria for graph-based games is proposed. Finally, the experimental study is dedicated to test our proposed solution concepts for ordinal graph-based games.

[1]  Christos H. Papadimitriou,et al.  Computing correlated equilibria in multi-player games , 2005, STOC '05.

[2]  Hykel Hosni,et al.  Possibilistic randomisation in strategic-form games , 2019, Int. J. Approx. Reason..

[3]  Eric van Damme,et al.  Non-Cooperative Games , 2000 .

[4]  Xavier Lorca,et al.  Choco: an Open Source Java Constraint Programming Library , 2008 .

[5]  Georg Gottlob,et al.  Pure Nash equilibria: hard and easy games , 2003, TARK '03.

[6]  Kenneth N. Brown,et al.  A Distributed Asynchronous Solver for Nash Equilibria in Hypergraphical Games , 2016, ECAI.

[7]  Steven W. Zucker,et al.  Copositive-plus Lemke algorithm solves polymatrix games , 1991, Oper. Res. Lett..

[8]  Michael Kearns,et al.  Algorithmic Game Theory: Graphical Games , 2007 .

[9]  Luis E. Ortiz,et al.  Nash Propagation for Loopy Graphical Games , 2002, NIPS.

[10]  Michel Grabisch,et al.  A decade of application of the Choquet and Sugeno integrals in multi-criteria decision aid , 2010, Ann. Oper. Res..

[11]  Didier Dubois,et al.  Decision-theoretic foundations of qualitative possibility theory , 2001, Eur. J. Oper. Res..

[12]  E. Rowland.  Theory of Games and Economic Behavior , 1946, Nature.

[13]  Dominik Wojtczak,et al.  Constrained Pure Nash Equilibria in Polymatrix Games , 2016, AAAI.

[14]  Nahla Ben Amor,et al.  Equilibria in Ordinal Games: A Framework based on Possibility Theory , 2017, IJCAI.

[15]  Jose B. Cruz,et al.  Ordinal Games and Generalized Nash and Stackelberg Solutions , 2000 .

[16]  Yoav Shoham,et al.  Run the GAMUT: a comprehensive approach to evaluating game-theoretic algorithms , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

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

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

[19]  Didier Dubois,et al.  Possibility theory and its applications: a retrospective and prospective view , 2003, The 12th IEEE International Conference on Fuzzy Systems, 2003. FUZZ '03..

[20]  Archie C. Chapman,et al.  A Distributed Algorithm for Optimising over Pure Strategy Nash Equilibria , 2010, AAAI.