{"type":"ScholarlyArticle","title":"Robustness against Agent Failure in Hedonic Games","authors":[{"name":"Ayumi Igarashi","slug":"ayumi-igarashi","given":"Ayumi","family":"Igarashi","affiliation":"University of Tokyo , Tokyo , Japan,"},{"name":"Kazunori Ota","slug":"kazunori-ota","given":"Kazunori","family":"Ota","affiliation":"Kyusu University , Fukuoka , Japan,"},{"name":"Yuko Sakurai","slug":"yuko-sakurai","given":"Yuko","family":"Sakurai","affiliation":"National Institute of Advanced Industrial Science and Technology , Tokyo , Japan"},{"name":"Makoto Yokoo","slug":"makoto-yokoo","given":"Makoto","family":"Yokoo","affiliation":"Kyusu University , Fukuoka , Japan,"}],"abstract":"We study how stability can be maintained even after any set of at most k players leave their groups, in the context of hedonic games. While stability properties ensure an outcome to be robust against players' deviations, it has not been considered how an unexpected change caused by a sudden deletion of players affects stable outcomes. In this paper we propose a novel criterion that reshapes stability form robustness aspect. We observe that some stability properties can be no longer preserved even when a single agent is removed. However, we obtain positive results by focusing on symmetric friend-oriented hedonic games. We prove that we can efficiently decide the existence of robust outcomes with respect to Nash stability underdeletion of any number of players or contractual individual stability under deletion of a single player. We also prove that symmetric additively separable games always admit an individual stable outcome that is robust with respect to individual rationality.","doi":"10.24963/ijcai.2019/52","url":"https://ijcai.org/proceedings/2019/52","pdf":"https://ijcai.org/proceedings/2019/0052.pdf","markdown":"https://ijcai.org/proceedings/2019/52.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/52","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":52,"pages":{"first":364,"last":370},"keywords":["Agent-based and Multi-agent Systems: Algorithmic Game Theory","Agent-based and Multi-agent Systems: Cooperative Games"],"videos":[],"references":[{"position":1,"raw":"[Alcalde and Revilla, 2004] J. Alcalde and P. Revilla. Re- searching with whom? stability and manipulation. Journal of Mathematical Economics, 40(8):869 -887, 2004.","title":"Researching with whom? stability and manipulation","authors":"Alcalde, Revilla, ] J Alcalde, P Revilla","year":"2004","venue":"Journal of Mathematical Economics","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Aziz et al., 2014] H. Aziz, F. Brandt, and P. Harrenstein. Fractional hedonic games. In Proceedings of the 13th In- ternational Conference on Autonomous Agents and Multi- Agent Systems (AAMAS), pages 5-12, 2014.","title":"Fractional hedonic games","authors":"H Aziz, F Brandt, P Harrenstein","year":"2014","venue":"Proceedings of the 13th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS)","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Aziz et al., 2017] H. Aziz, F. Brandl, F. Brandt, P. Harren- stein, M. Olsen, and D. Peters. Fractional hedonic games. CoRR, abs/1705.10116, 2017.","title":"Fractional hedonic games","authors":"H Aziz, F Brandl, F Brandt, P Harrenstein, M Olsen, D Peters","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bachrach et al., 2011] Y. Bachrach, R. Meir, M. Feldman, and M. Tennenholtz. Solving cooperative reliability games. In Proceedings of the 27th Annual Conference on Uncertainty in Artificial Intelligence (UAI), pages 27-34, 2011.","title":"Solving cooperative reliability games","authors":"Y Bachrach, R Meir, M Feldman, M Tennenholtz","year":"2011","venue":"Proceedings of the 27th Annual Conference on Uncertainty in Artificial Intelligence (UAI)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Banerjee et al., 2001] S. Banerjee, H. Konishi, and T. Sönmez. Core in a simple coalition formation game. Social Choice and Welfare, 18(1):135-153, 2001.","title":"Core in a simple coalition formation game","authors":"S Banerjee, H Konishi, T Sönmez","year":"2001","venue":"Social Choice and Welfare","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bilò et al., 2014] V. Bilò, A. Fanelli, M. Flammini, G. Monaco, and L. Moscardelli. Nash stability in fractional hedonic games. In Proceedings of the 10th Conference on Web and Internet Economics (WINE), pages 486-491, 2014.","title":"Nash stability in fractional hedonic games","authors":"V Bilò, A Fanelli, M Flammini, G Monaco, L Moscardelli","year":"2014","venue":"Proceedings of the 10th Conference on Web and Internet Economics (WINE)","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"A. Bogomolnaia and M.O. Jackson. The stability of hedonic coalition struc- tures. Games and Economic Behavior, 38(2):201-230, 2002.","title":"The stability of hedonic coalition structures","authors":"A Bogomolnaia, M O Jackson","year":"2002","venue":"Games and Economic Behavior","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Darmann et al., 2017] A. Darmann, E. Elkind, S. Kurz, J. Lang, J. Schauer, and G. Woeginger. Group activity se- lection problem. International Journal of Game Theory, 2017.","title":"Group activity selection problem","authors":"A Darmann, E Elkind, S Kurz, J Lang, J Schauer, G Woeginger","year":"2017","venue":"International Journal of Game Theory","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Dimitrov et al., 2006] D. Dimitrov, P. Borm, R. Hendrickx, and S. C. Sung. Simple priorities and core stability in he- donic games. Social Choice and Welfare, 26(2):421-433, 2006.","title":"Simple priorities and core stability in hedonic games","authors":"D Dimitrov, P Borm, R Hendrickx, S C Sung","year":"2006","venue":"Social Choice and Welfare","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Fedoruk and Deters, 2002] A. Fedoruk and R. Deters. Im- proving fault-tolerance by replicating agents. In Proceed- ings of the 1st International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pages 737- 744, 2002.","title":"Improving fault-tolerance by replicating agents","authors":"A Fedoruk, R Deters","year":"2002","venue":"Proceedings of the 1st International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Gairing and Savani, 2010] M. Gairing and R. Savani. Com- puting stable outcomes in hedonic games. In Proceedings of the 3rd International Symposium on Algorithmic Game Theory (SAGT), pages 174-185, 2010.","title":"Computing stable outcomes in hedonic games","authors":"M Gairing, R Savani","year":"2010","venue":"Proceedings of the 3rd International Symposium on Algorithmic Game Theory (SAGT)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Gairing and Savani, 2011] M. Gairing and R. Savani. Com- puting stable outcomes in hedonic games with voting- based deviations. In Proceedings of the 10th International Conference on Autonomous Agents and Multi-Agent Sys- tems (AAMAS), pages 559-566, 2011.","title":"Computing stable outcomes in hedonic games with votingbased deviations","authors":"M Gairing, R Savani","year":"2011","venue":"Proceedings of the 10th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS)","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Gale and Shapley, 1962] D. Gale and L.S. Shapley. College Admissions and the Stability of Marriage. The American Mathematical Monthly, 69:9-15, 1962.","title":"College Admissions and the Stability of Marriage","authors":"D Gale, L S Shapley","year":"1962","venue":"The American Mathematical Monthly","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Igarashi and Elkind, 2016] A. Igarashi and E. Elkind. He- donic games with graph-restricted communication. In Proceedings of the 15th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pages 242-250, 2016.","title":"Hedonic games with graph-restricted communication","authors":"Elkind Igarashi, A Igarashi, E Elkind","year":"2016","venue":"Proceedings of the 15th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS)","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Igarashi et al., 2017] A. Igarashi, D. Peters, and E. Elkind. Group activity selection on social networks. In Proceed- ings of the 31st AAAI Conference on Artificial Intelligence (AAAI), pages 565-571, 2017. Extended version available as arXiv:1611.04524 [cs.GT.","title":"Group activity selection on social networks","authors":"A Igarashi, D Peters, E Elkind","year":"2017","venue":"Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Igarashi et al., 2019] A. Igarashi, K. Ota, Y. Sakurai, and M. Yokoo. Robustness agains agent failure in hedonic games. CoRR, abs/1903.05534, 2019.","title":"Robustness agains agent failure in hedonic games","authors":"A Igarashi, K Ota, Y Sakurai, M Yokoo","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Kouvaros and Lomuscio, 2017] Panagiotis Kouvaros and Alessio Lomuscio. Verifying fault-tolerance in parame- terised multi-agent systems. In Proceedings of the 26th In- ternational Joint Conference on Artificial Intelligence (IJ- CAI), pages 288-294, 2017.","title":"Verifying fault-tolerance in parameterised multi-agent systems","authors":"Panagiotis Kouvaros, Alessio Lomuscio","year":"2017","venue":"Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJ-CAI)","doi":null,"url":null,"internal_url":"/proceedings/2017/41"},{"position":18,"raw":"[Kouvaros et al., 2018] P. Kouvaros, A. Lomuscio, and E. Pirovano. Symbolic synthesis of fault-tolerance ratios in parameterised multi-agent systems. In Proceedings of the 27th International Joint Conference on Artificial Intelli- gence (IJCAI), pages 324-330, 2018.","title":"Symbolic synthesis of fault-tolerance ratios in parameterised multi-agent systems","authors":"P Kouvaros, A Lomuscio, E Pirovano","year":"2018","venue":"Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/2018/45"},{"position":19,"raw":"[Okimoto et al., 2015] T. Okimoto, N. Schwind, M. Clement, T. Ribeiro, K. Inoue, and P. Marquis. How to form a task-oriented robust team. In Proceedings of the 14th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pages 395-403, 2015.","title":"How to form a task-oriented robust team","authors":"T Okimoto, N Schwind, M Clement, T Ribeiro, K Inoue, P Marquis","year":"2015","venue":"Proceedings of the 14th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS)","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Peters, 2016] D. Peters. Graphical hedonic games of bounded treewidth. In Proceedings of the 30th AAAI Con- ference on Artificial Intelligence (AAAI), pages 586-593, 2016.","title":"Graphical hedonic games of bounded treewidth","authors":"D Peters","year":"2016","venue":"Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI)","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Schrijver, 2003] A. Schrijver. Combinatorial Optimization Polyhedra and Efficiency, volume 24. Springer-Verlag Berlin Heidelberg, 2003.","title":"Combinatorial Optimization Polyhedra and Efficiency","authors":"A Schrijver","year":"2003","venue":null,"doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Varma and Yoshida, 2019] N. Varma and Y. Yoshida. Average sensitivity of graph algorithms. CoRR, abs/1904.03248, 2019.","title":"Average sensitivity of graph algorithms","authors":"N Varma, Y Yoshida","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}