{"type":"ScholarlyArticle","title":"Synchronisation Games on Hypergraphs","authors":[{"name":"Sunil Simon","slug":"sunil-simon","given":"Sunil","family":"Simon","affiliation":"IIT Kanpur Kanpur , India"},{"name":"Dominik Wojtczak","slug":"dominik-wojtczak","given":"Dominik","family":"Wojtczak","affiliation":"University of Liverpool Liverpool ,"}],"abstract":"We study a strategic game model on hypergraphs where players, modelled by nodes, try to coordinate or anti-coordinate their choices within certain groups of players, modelled by hyperedges. We show this model to be a strict generalisation of symmetric additively separable hedonic games to the hypergraph setting and that such games always have a pure Nash equilibrium, which can be computed in pseudo-polynomial time. Moreover, in the pure coordination setting, we show that a strong equilibrium exists and can be computed in polynomial time when the game possesses a certain acyclic structure.","doi":"10.24963/ijcai.2017/57","url":"https://ijcai.org/proceedings/2017/57","pdf":"https://ijcai.org/proceedings/2017/0057.pdf","markdown":"https://ijcai.org/proceedings/2017/57.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/57","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":"Agent-based and Multi-agent Systems","track":"Main track","number":57,"pages":{"first":402,"last":408},"keywords":["Agent-based and Multi-agent Systems: Agent Theories and Models","Agent-based and Multi-agent Systems: Coordination and cooperation","Agent-based and Multi-agent Systems: Noncooperative Games"],"videos":[],"references":[{"position":1,"raw":"[Anagnostopoulos et al., 2010] A. Anagnostopoulos, L. Becchetti, C. Castillo, A. Gionis, and S. Leonardi. Power in unity: Forming teams in large-scale community systems. In Proceedings of the 19th International Conference on Information and Knowledge Management, pages 599-608. ACM, 2010.","title":"Power in unity: Forming teams in large-scale community systems","authors":"A Anagnostopoulos, L Becchetti, C Castillo, A Gionis, S Leonardi","year":"2010","venue":"Proceedings of the 19th International Conference on Information and Knowledge Management","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Apt et al., 2015] K.R. Apt, S. Simon, and D. Wojtczak. Coordina- tion games on directed graphs. In Proceedings of the 15th TARK, 2015.","title":"Coordination games on directed graphs","authors":"K R Apt, S Simon, D Wojtczak","year":"2015","venue":"Proceedings of the 15th TARK","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Apt et al., 2016] K.R. Apt, B.de Keijzer, M. Rahn, G. Schäfer, and S. Simon. Coordination games on graphs. International Journal of Game Theory, 2016.","title":"Coordination games on graphs","authors":"K R Apt, B De Keijzer, M Rahn, G Schäfer, S Simon","year":"2016","venue":"International Journal of Game Theory","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Aumann, 1959] R. J. Aumann. Acceptable points in general coop- erative n-person games. In Contribution to the Theory of Games (AM-40), volume IV, pages 287-324. Princeton University Press, 1959.","title":"Acceptable points in general cooperative n-person games","authors":"R J Aumann","year":"1959","venue":"Contribution to the Theory of Games (AM-40)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Aziz and Savani, 2016] H. Aziz and R. Savani. Hedonic games, chapter 15, pages 356-376. Handbook of Computational Social Choice. Cambridge University Press, 2016.","title":"Hedonic games","authors":"H Aziz, R Savani","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Babichenko and Tamuz, 2016] Y. Babichenko and O. Tamuz. Graphical potential games. Journal of Economic Theory, 163:889-899, 2016.","title":"Graphical potential games","authors":"Y Babichenko, O Tamuz","year":"2016","venue":"Journal of Economic Theory","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"A. Bogomolnaia and M. Jack- son. The stability of hedonic coalition structures. Games and Economic Behavior, 38(2):201-230, 2002.","title":"The stability of hedonic coalition structures","authors":"A Bogomolnaia, M Jackson","year":"2002","venue":"Games and Economic Behavior","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bramoullé, 2007] Y. Bramoullé. Anti-coordination and social in- teractions. Games and Economic Behaviour, 58:30-49, 2007.","title":"Anti-coordination and social interactions","authors":"Y Bramoullé","year":"2007","venue":"Games and Economic Behaviour","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Brault-Baron, 2014] J. Brault-Baron. Hypergraph acyclicity revis- ited. ArXiv e-prints, 2014.","title":"Hypergraph acyclicity revisited","authors":"J Brault-Baron","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Bulò and Pelillo, 2009] S.R. Bulò and M. Pelillo. A game- theoretic approach to hypergraph clustering. In Proceedings of the 23rd NIPS, pages 1571-1579, 2009.","title":"A gametheoretic approach to hypergraph clustering","authors":"S R Bulò, M Pelillo","year":"2009","venue":"Proceedings of the 23rd NIPS","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Cai and Daskalakis, 2011] Y. Cai and C. Daskalakis. On minmax theorems for multiplayer games. In Proceedings of the 22nd Sym- posium on Discrete Algorithms, pages 217-234. SIAM, 2011.","title":"On minmax theorems for multiplayer games","authors":"Y Cai, C Daskalakis","year":"2011","venue":"Proceedings of the 22nd Symposium on Discrete Algorithms","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Capelli et al., 2014] F. Capelli, A. Durand, and S. Mengel. Hy- pergraph acyclicity and propositional model counting. In Pro- ceedings of the 17th International Conference on Theory and Ap- plications of Satisfiability Testing, volume 8561 of LNCS, pages 399-414. Springer, 2014.","title":"Hypergraph acyclicity and propositional model counting","authors":"F Capelli, A Durand, S Mengel","year":"2014","venue":"Proceedings of the 17th International Conference on Theory and Applications of Satisfiability Testing","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Deligkas et al., 2014] A. Deligkas, J. Fearnley, R. Savani, and P. Spirakis. Computing approximate Nash equilibria in polyma- trix games. In Proceedings of the 10th International Conference on Web and Internet Economics, volume 8877 of LNCS, pages 58-71. Springer, 2014.","title":"Computing approximate Nash equilibria in polymatrix games","authors":"A Deligkas, J Fearnley, R Savani, P Spirakis","year":"2014","venue":"Proceedings of the 10th International Conference on Web and Internet Economics","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Drèze and Greenberg, 1980] J.H. Drèze and J. Greenberg. He- donic coalitions: Optimality and stability. Econometrica, 48(4):987-1003, 1980.","title":"Hedonic coalitions: Optimality and stability","authors":"J H Drèze, J Greenberg","year":"1980","venue":"Econometrica","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Duris, 2012] D. Duris. Some characterizations of γ and β- acyclicity of hypergraphs. Information Processing Letters, 112(16):617-620, 2012.","title":"Some characterizations of γ and βacyclicity of hypergraphs","authors":"D Duris","year":"2012","venue":"Information Processing Letters","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Elkind and Wooldridge, 2009] E. Elkind and M. Wooldridge. He- donic coalition nets. In Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems, pages 417-424, 2009.","title":"Hedonic coalition nets","authors":"E Elkind, M Wooldridge","year":"2009","venue":"Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Etscheid and Röglin, 2014] M. Etscheid and H. Röglin. Smoothed analysis of local search for the maximum-cut problem. In Pro- ceedings of the 25th Symposium on Discrete Algorithms, pages 882-889, 2014.","title":"Smoothed analysis of local search for the maximum-cut problem","authors":"M Etscheid, H Röglin","year":"2014","venue":"Proceedings of the 25th Symposium on Discrete Algorithms","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Fagin, 1983] R. Fagin. Degrees of acyclicity for hypergraphs and relational database schemes. Journal of ACM, 30(3):514-550, 1983.","title":"Degrees of acyclicity for hypergraphs and relational database schemes","authors":"R Fagin","year":"1983","venue":"Journal of ACM","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Feldman et al., 2012] M. Feldman, L. Lewin-Eytan, and J.S. Naor. Hedonic clustering games. In Proceedings of the 24th Symposium on Parallelism in Algorithms and Architectures, pages 267-276. ACM, 2012.","title":"Hedonic clustering games","authors":"M Feldman, L Lewin-Eytan, J S Naor","year":"2012","venue":"Proceedings of the 24th Symposium on Parallelism in Algorithms and Architectures","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Gottlob et al., 2002] G. Gottlob, N. Leone, and F. Scarcello. Hy- pertree decompositions and tractable queries. Journal of Com- puter and System Sciences, 64(3):579-627, 2002.","title":"Hypertree decompositions and tractable queries","authors":"G Gottlob, N Leone, F Scarcello","year":"2002","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Gottlob et al., 2005] G. Gottlob, G. Greco, and F. Scarcello. Pure Nash equilibria: Hard and easy games. Journal of Artificial Intel- ligence Research, 24:357-406, 2005.","title":"Pure Nash equilibria: Hard and easy games","authors":"G Gottlob, G Greco, F Scarcello","year":"2005","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Hajdukova, 2006] J. Hajdukova. Coalition formation games: A survey. International Game Theory Review, 8(4):613-641, 2006.","title":"Coalition formation games: A survey","authors":"J Hajdukova","year":"2006","venue":"International Game Theory Review","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Hoefer, 2007] M. Hoefer. Cost Sharing and Clustering under Dis- tributed Competition. PhD thesis, University of Konstanz, 2007.","title":"Cost Sharing and Clustering under Distributed Competition","authors":"M Hoefer","year":"2007","venue":null,"doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Janovskaya, 1968] E.B. Janovskaya. Equilibrium points in poly- matrix games. Litovskii Matematicheskii Sbornik, 8:381-384, 1968.","title":"Equilibrium points in polymatrix games","authors":"E B Janovskaya","year":"1968","venue":"Litovskii Matematicheskii Sbornik","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Jiang et al., 2011] A.X. Jiang, K. Leyton-Brown, and N.A.R. Bhat. Action-graph games. Games and Economic Behavior, 71(1):141-173, 2011.","title":"Action-graph games","authors":"A X Jiang, K Leyton-Brown, N A R Bhat","year":"2011","venue":"Games and Economic Behavior","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Johnson et al., 1988] D.S. Johnson, C.H. Papadimitriou, and M. Yannakakis. How easy is local search? Journal of Computer and System Sciences, 37(1):79-100, 1988.","title":"How easy is local search","authors":"D S Johnson, C H Papadimitriou, M Yannakakis","year":"1988","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Kearns et al., 2001] M. Kearns, M. Littman, and S. Singh. Graph- ical models for game theory. In Proceedings of the 13th Con- ference on Uncertainty In Artificial Intelligence, pages 253-260, 2001.","title":"Graphical models for game theory","authors":"M Kearns, M Littman, S Singh","year":"2001","venue":"Proceedings of the 13th Conference on Uncertainty In Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Majumder et al., 2012] A. Majumder, S. Datta, and K.V.M. Naidu. Capacitated team formation problem on social networks. In Pro- ceedings of the 18th International Conference on Knowledge Dis- covery and Data Mining, pages 1005-1013. ACM, 2012.","title":"Capacitated team formation problem on social networks","authors":"A Majumder, S Datta, K V M Naidu","year":"2012","venue":"Proceedings of the 18th International Conference on Knowledge Discovery and Data Mining","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Ortiz, 2015] L.E. Ortiz. Graphical potential games. arXiv preprint arXiv:1505.01539, 2015.","title":"Graphical potential games","authors":"L E Ortiz","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Papadimitriou and Roughgarden, 2008] C.H. Papadimitriou and T. Roughgarden. Computing correlated equilibria in multi-player games. Journal of the ACM, 55(3):14:1-14:29, 2008.","title":"Computing correlated equilibria in multi-player games","authors":"C H Papadimitriou, T Roughgarden","year":"2008","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Pelillo and Buló, 2014] M. Pelillo and S.R. Buló. Clustering games. Studies in Computational Intelligence, 532:157-186, 2014.","title":"Clustering games","authors":"M Pelillo, S R Buló","year":"2014","venue":"Studies in Computational Intelligence","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Peters, 2016] D. Peters. Graphical hedonic games of bounded treewidth. In Proceedings of the 30th AAAI Conference on Ar- tificial Intelligence. AAAI Press, 2016.","title":"Graphical hedonic games of bounded treewidth","authors":"D Peters","year":"2016","venue":"Proceedings of the 30th AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Rahn and Schäfer, 2015] M. Rahn and G. Schäfer. Efficient equi- libria in polymatrix coordination games. In Proceedings of the 40th MFCS, pages 529-541, 2015.","title":"Efficient equilibria in polymatrix coordination games","authors":"M Rahn, G Schäfer","year":"2015","venue":"Proceedings of the 40th MFCS","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Robertson and Seymour, 1986] N. Robertson and P.D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms, 7(3):309-322, 1986.","title":"Graph minors. II. Algorithmic aspects of tree-width","authors":"N Robertson, P D Seymour","year":"1986","venue":"Journal of Algorithms","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Schäffer and Yannakakis, 1991] A.A. Schäffer and M. Yan- nakakis. Simple local search problems that are hard to solve. SIAM Journal on Computing, 20(1):56-87, 1991.","title":"Simple local search problems that are hard to solve","authors":"A A Schäffer, M Yannakakis","year":"1991","venue":"SIAM Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Sless et al., 2014] L. Sless, N. Hazon, S. Kraus, and M. Wooldridge. Forming coalitions and facilitating relationships for completing tasks in social networks. In Proceedings of the 13th AAMAS, pages 261-268, 2014.","title":"Forming coalitions and facilitating relationships for completing tasks in social networks","authors":"L Sless, N Hazon, S Kraus, M Wooldridge","year":"2014","venue":"Proceedings of the 13th AAMAS","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}