Robustness against Agent Failure in Hedonic Games

被引:0
作者
Igarashi, Ayumi [1 ]
Ota, Kazunori [2 ]
Sakurai, Yuko [3 ]
Yokoo, Makoto [2 ]
机构
[1] Univ Tokyo, Tokyo, Japan
[2] Kyusu Univ, Fukuoka, Japan
[3] Natl Inst Adv Ind Sci & Technol, Tokyo, Japan
来源
PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE | 2019年
关键词
STABILITY; CORE;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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 under deletion 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.
引用
收藏
页码:364 / 370
页数:7
相关论文
共 50 条
[21]   Stable and Envy-free Partitions in Hedonic Games [J].
Barrot, Nathanael ;
Yokoo, Makoto .
PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, :67-73
[22]   Robustness Against Indirect Invasions in Asymmetric Games with Continuous Strategy Spaces [J].
Narang, Aradhana ;
Shaiju, A. J. .
INTERNATIONAL GAME THEORY REVIEW, 2023, 25 (04)
[23]   An Algorithm for Generating Nash Stable Coalition Structures in Hedonic Games [J].
Keinanen, Helena .
FOUNDATIONS OF INFORMATION AND KNOWLEDGE SYSTEMS, PROCEEDINGS, 2010, 5956 :25-39
[24]   Local Fairness in Hedonic Games via Individual Threshold Coalitions [J].
Nhan-Tam Nguyen ;
Rothe, Joerg .
AAMAS'16: PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS, 2016, :232-241
[25]   Local Search Algorithms for Core Checking in Hedonic Coalition Games [J].
Keinaenen, Helena .
COMPUTATIONAL COLLECTIVE INTELLIGENCE: SEMANTIC WEB, SOCIAL NETWORKS AND MULTIAGENT SYSTEMS, 2009, 5796 :51-62
[26]   Noncooperative formation of coalitions in hedonic games [J].
Bloch, Francis ;
Diamantoudi, Effrosyni .
INTERNATIONAL JOURNAL OF GAME THEORY, 2011, 40 (02) :263-280
[27]   Computing Stable Outcomes in Hedonic Games [J].
Gairing, Martin ;
Savani, Rahul .
ALGORITHMIC GAME THEORY, 2010, 6386 :174-185
[28]   Separable Hedonic Games and Contractually Stabilities [J].
Tanaka, Masaya ;
Sung, Shao-Chin .
PROCEEDINGS OF THE 20TH CZECH-JAPAN SEMINAR ON DATA ANALYSIS AND DECISION MAKING UNDER UNCERTAINTY, 2017, :204-211
[29]   Price of Pareto Optimality in Hedonic Games [J].
Elkind, Edith ;
Fanelli, Angelo ;
Flammini, Michele .
THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, :475-481
[30]   Price of Pareto Optimality in hedonic games [J].
Elkind, Edith ;
Fanelli, Angelo ;
Flammini, Michele .
ARTIFICIAL INTELLIGENCE, 2020, 288