English

Individual and Group Stability in Neutral Restrictions of Hedonic Games

Computer Science and Game Theory 2018-04-19 v1

Abstract

We consider a class of coalition formation games called hedonic games, i.e., games in which the utility of a player is completely determined by the coalition that the player belongs to. We first define the class of subset-additive hedonic games and show that they have the same representation power as the class of hedonic games. We then define a restriction of subset-additive hedonic games that we call subset-neutral hedonic games and generalize a result by Bogomolnaia and Jackson (2002) by showing the existence of a Nash stable partition and an individually stable partition in such games. We also consider neutrally anonymous hedonic games and show that they form a subclass of the subset-additive hedonic games. Finally, we show the existence of a core stable partition that is also individually stable in neutrally anonymous hedonic games by exhibiting an algorithm to compute such a partition.

Keywords

Cite

@article{arxiv.1804.03315,
  title  = {Individual and Group Stability in Neutral Restrictions of Hedonic Games},
  author = {Warut Suksompong},
  journal= {arXiv preprint arXiv:1804.03315},
  year   = {2018}
}