{"type":"ScholarlyArticle","title":"Constraint Games revisited","authors":[{"name":"Anthony Palmieri","slug":"anthony-palmieri","given":"Anthony","family":"Palmieri","affiliation":"Huawei Technologies Ltd , French Research Center Greyc , University of Caen -Normandie"},{"name":"Arnaud Lallouet","slug":"arnaud-lallouet","given":"Arnaud","family":"Lallouet","affiliation":"Huawei Technologies Ltd , French Research Center Greyc , University of Caen -Normandie"}],"abstract":"Constraint Games are a recent framework proposed to model and solve static games where Constraint Programming is used to express players preferences.  In this paper, we rethink their solving technique in terms of constraint propagation by considering players preferences as global constraints.  It yields not only a more elegant but also a more efficient framework.  Our new complete solver is faster than previous state-of-the-art and is able to find all pure Nash equilibria for some problems with 200 players.  We also show that performances can greatly be improved for graphical games, allowing some games with 2000 players to be solved.","doi":"10.24963/ijcai.2017/101","url":"https://ijcai.org/proceedings/2017/101","pdf":"https://ijcai.org/proceedings/2017/0101.pdf","markdown":"https://ijcai.org/proceedings/2017/101.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/101","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Constraints and Satisfiability","track":"Main track","number":101,"pages":{"first":729,"last":735},"keywords":["Constraints and Satisfiability: Solvers and Tools","Constraints and Satisfiability: Global Constraints","Agent-based and Multi-agent Systems: Noncooperative Games","Agent-based and Multi-agent Systems: Engineering methods, platforms, languages and tools"],"videos":[],"references":[{"position":1,"raw":"Krzysztof R. Apt. The Essence of Constraint Propagation. Theor. Comput. Sci., 221(1-2):179-210, 1999.","title":"The Essence of Constraint Propagation","authors":"R Krzysztof, Apt","year":"1999","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Arthur, 1994] Brian W. Arthur. Complexity in Economic Theory. Inductive Reasoning and Bounded Rationality. American Economic Review, 82(2):406-411, 1994.","title":"Complexity in Economic Theory. Inductive Reasoning and Bounded Rationality","authors":"Brian W Arthur","year":"1994","venue":"American Economic Review","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bienvenu et al., 2010] Meghyn Bienvenu, Jérôme Lang, and Nic Wilson. From Preference Logics to Prefer- ence Languages, and Back. In F. Lin, U. Sattler, and M. Truszczynski, editors, KR 2010, Toronto, Ontario, Canada, May 9-13, 2010. AAAI Press, 2010.","title":"From Preference Logics to Preference Languages, and Back","authors":"Bienvenu","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bonzon et al., 2006] Elise Bonzon, Marie-Christine Lagasquie-Schiex, Jérôme Lang, and Bruno Zanuttini. Boolean Games Revisited. In G. Brewka, S. Coradeschi, A. Perini, and P. Traverso, editors, ECAI, volume 141 of Frontiers in Artificial Intelligence and Applications, pages 265-269. IOS Press, 2006.","title":"Boolean Games Revisited","authors":"Elise Bonzon, Marie-Christine Lagasquie-Schiex, Jérôme Lang, Bruno Zanuttini","year":"2006","venue":"Frontiers in Artificial Intelligence and Applications","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bordeaux and Monfroy, 2002] Lucas Bordeaux and Eric Monfroy. Beyond NP: Arc-Consistency for Quantified Constraints. In P. Van Hentenryck, editor, CP 2002, Ithaca, NY, USA, September 9-13, 2002, volume 2470 of LNCS, pages 371-386. Springer, 2002.","title":"Lucas Bordeaux and Eric Monfroy. Beyond NP: Arc-Consistency for Quantified Constraints","authors":"Monfroy Bordeaux","year":"2002","venue":"CP 2002","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Ceppi et al., 2010] Sofia Ceppi, Nicola Gatti, Giorgio Pa- trini, and Marco Rocco. Local Search Methods for Find- ing a Nash Equilibrium in Two-Player Games. In J. Xi- angji Huang, A. A. Ghorbani, M.-S. Hacid, and T. Yam- aguchi, editors, IAT, pages 335-342. IEEE Computer So- ciety Press, 2010.","title":"Local Search Methods for Finding a Nash Equilibrium in Two-Player Games","authors":"Ceppi","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Fudenberg and Tirole, 1991] D. Fudenberg and J. Tirole. Game Theory. The MIT Press, 1991.","title":"Game Theory","authors":"D Fudenberg, J Tirole","year":"1991","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Gottlob et al., 2005] Georg Gottlob, Gianluigi Greco, and Francesco Scarcello. Pure Nash Equilibria: Hard and Easy Games. J. Artif. Intell. Res. (JAIR), 24:357-406, 2005.","title":"Pure Nash Equilibria: Hard and Easy Games","authors":"Georg Gottlob, Gianluigi Greco, Francesco Scarcello","year":"2005","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Grinshpoun et al., 2013] Tal Grinshpoun, Alon Grubshtein, Roie Zivan, Arnon Netzer, and Amnon Meisels. Asym- metric Distributed Constraint Optimization Problems. J. Artif. Intell. Res. (JAIR), 47:613-647, 2013.","title":"Asymmetric Distributed Constraint Optimization Problems","authors":"Alon Tal Grinshpoun, Roie Grubshtein, Arnon Zivan, Amnon Netzer, Meisels","year":"2013","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Harrenstein et al., 2001] Paul Harrenstein, Wiebe van der Hoek, John-Jules Ch. Meyer, and Cees Witteveen. Boolean Games. In Johan van Benthem, editor, TARK. Morgan Kaufmann, 2001.","title":"Boolean Games","authors":"Paul Harrenstein, John-Jules Wiebe Van Der Hoek, Ch, Cees Meyer, Witteveen","year":"2001","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Jackson, 2008] Matthew O Jackson. Social and Economic Networks, volume 3. Princeton university press Princeton, 2008.","title":"Social and Economic Networks","authors":"Jackson Matthew","year":"2008","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Jiang et al., 2011] Albert Xin Jiang, Kevin Leyton-Brown, and Navin A. R. Bhat. Action-Graph Games. Games and Economic Behavior, 71(1):141-173, 2011.","title":"Action-Graph Games","authors":"Albert Xin Jiang, Kevin Leyton-Brown, Navin A R Bhat","year":"2011","venue":"Games and Economic Behavior","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Kearns et al., 2001] Michael J. Kearns, Michael L. Littman, and Satinder P. Singh. Graphical Models for Game The- ory. In Jack S. Breese and Daphne Koller, editors, UAI, pages 253-260.","title":"Graphical Models for Game Theory","authors":"J Michael, Michael L Kearns, Satinder P Littman, Singh","year":null,"venue":"UAI","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"Morgan Kaufmann, 2001.","title":null,"authors":"Morgan Kaufmann","year":"2001","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[McKelvey et al., 2016] Richard D McKelvey, Andrew M McLennan, and Theodore L Turocy. Gambit: Software Tools for Game Theory, version 16.0.0 edition, 2016.","title":"Gambit: Software Tools for Game Theory","authors":"Andrew M Richard D Mckelvey, Theodore L Mclennan, Turocy","year":"2016","venue":"version","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Nash, 1951] J.F. Nash. Non-cooperative Games. Annals of Mathematics, 54(2):286-295, 1951.","title":"Non-cooperative Games","authors":"J F Nash","year":"1951","venue":"Annals of Mathematics","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Nguyen and Lallouet, 2014] Thi-Van-Anh Nguyen and Ar- naud Lallouet. A Complete Solver for Constraint Games. In Barry O'Sullivan, editor, CP 2014, Lyon, France, September 8-12, 2014., volume 8656 of LNCS, pages 58- 74. Springer, 2014.","title":"A Complete Solver for Constraint Games","authors":"Thi-Van-Anh Nguyen, Arnaud Lallouet","year":"2014","venue":"CP 2014","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Nguyen et al., 2013] Thi-Van-Anh Nguyen, Arnaud Lal- louet, and Lucas Bordeaux. Constraint Games: Frame- work and Local Search Solver. In É. Grégoire and B. Mazure, editors, ICTAI, Special Track on SAT and CSP Technologies, pages 963-970. Springer, 2013.","title":"Constraint Games: Framework and Local Search Solver","authors":"Thi-Van-Anh Nguyen, Arnaud Lallouet, Lucas Bordeaux","year":"2013","venue":"ICTAI, Special Track on SAT and CSP Technologies","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Nudelman et al., 2004] Eugene Nudelman, Jennifer Wortman, Yoav Shoham, and Kevin Leyton-Brown. Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms. In AA- MAS, pages 880-887. IEEE Computer Society, 2004. http://gamut.stanford.edu/.","title":"Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms","authors":"Eugene Nudelman, Jennifer Wortman, Yoav Shoham, Kevin Leyton-Brown","year":"2004","venue":"AA-MAS","doi":null,"url":"http://gamut.stanford.edu/","internal_url":null},{"position":20,"raw":"[Ortiz and Kearns, 2002] Luis E. Ortiz and Michael J. Kearns. Nash Propagation for Loopy Graphical Games. In S. Becker, S. Thrun, and K. Obermayer, editors, NIPS 2002, December 9-14, 2002, Vancouver, British Columbia, Canada], pages 793-800. MIT Press, 2002.","title":"Nash Propagation for Loopy Graphical Games","authors":"Luis E Ortiz, Michael J Kearns","year":"2002","venue":"NIPS 2002","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Prud'homme et al., 2017] Charles Prud'homme, Jean- Guillaume Fages, and Xavier Lorca. Choco Documenta- tion. TASC, INRIA Rennes, LINA CNRS UMR 6241, COSLING S.A.S., 2017. [Roberson, 2006]","title":"Choco Documentation","authors":"Prud'homme","year":"2006","venue":null,"doi":null,"url":null,"internal_url":null},{"position":22,"raw":"Brian Roberson. The Colonel Blotto Game. Economic Theory, 29(1):1-24, 2006.","title":"The Colonel Blotto Game","authors":"Brian Roberson","year":"2006","venue":"Economic Theory","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Rosen, 1965] J. B. Rosen. Existence and Uniqueness of Equilibrium Points for Concave n-Person Games. Econo- metrica, 33(3):520-534, July 1965.","title":"Existence and Uniqueness of Equilibrium Points for Concave n-Person Games","authors":"J B Rosen","year":"1965","venue":"Econometrica","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Rossi et al., 2006] Francesca Rossi, Peter van Beek, and Toby Walsh. Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc., New York, NY, USA, 2006.","title":"Handbook of Constraint Programming","authors":"Francesca Rossi, Peter Van Beek, Toby Walsh","year":"2006","venue":"Foundations of Artificial Intelligence)","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Vickrey and Koller, 2002] David Vickrey and Daphne Koller. Multi-Agent Algorithms for Solving Graphical Games. In Rina Dechter and Richard S. Sutton, editors, AAAI 2002, July 28 -August 1, 2002, Edmonton, Alberta, Canada., pages 345-351. AAAI Press / The MIT Press, 2002.","title":"Multi-Agent Algorithms for Solving Graphical Games","authors":"Koller Vickrey, David Vickrey, Daphne Koller","year":"2002","venue":"AAAI 2002","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Von Neumann and Morgenstern, 1944] John Von Neumann and Oskar Morgenstern. Theory of Games and Economic Behavior. Princeton University Press, 1944.","title":"John Von Neumann and Oskar Morgenstern","authors":"Von Neumann, Morgenstern","year":"1944","venue":null,"doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[von Wright, 1963] Georg H. von Wright. The Logic of Pref- erence. Edinburgh University Press, 1963.","title":"The Logic of Preference","authors":"Georg H Wright","year":"1963","venue":null,"doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Wahbi and Brown, 2016] Mohamed Wahbi and Kenneth N. Brown. A Distributed Asynchronous Solver for Nash Equilibria in Hypergraphical Games. In G. A. Kaminka, M. Fox, P. Bouquet, E. Hüllermeier, V. Dignum, F. Dignum, and F. van Harmelen, editors, ECAI 2016, 29 August-2 September 2016, The Hague, The Netherlands, volume 285 of Frontiers in Artificial Intelligence and Ap- plications, pages 1291-1299. IOS Press, 2016.","title":"A Distributed Asynchronous Solver for Nash Equilibria in Hypergraphical Games","authors":"Mohamed Wahbi, Kenneth N Brown","year":"2016","venue":"Frontiers in Artificial Intelligence and Applications","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}