Boolean Hedonic Games

Haris Aziz (1) , Paul Harrenstein (2) , Jérôme Lang (3) , Michael Wooldridge (2)

1 University of South Wales
2 Department of Computer Science [Oxford]
3 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision

We study hedonic games with dichotomous preferences. Hedonic games are cooperative games in which players desire to form coalitions, but only care about the makeup of the coalitions of which they are members; they are indifferent about the makeup of other coalitions. The assumption of dichotomous preferences means that, additionally, each player's preference relation partitions the set of coalitions of which that player is a member into just two equivalence classes: satisfactory and unsatisfactory. A player is indifferent between satisfactory coalitions, and is indifferent between unsatisfactory coalitions, but strictly prefers any satisfactory coalition over any unsatisfactory coalition. We develop a succinct representation for such games, in which each player's preference relation is represented by a propositional formula. We show how solution concepts for hedonic games with dichotomous preferences are characterised by propositional formulas.

Mots clés: hedonic games

Domaines: Informatique [cs]

Haris Aziz, Paul Harrenstein, Jérôme Lang, Michael Wooldridge. Boolean Hedonic Games. 15th International Conference on Principles of Knowledge Representation and Reasoning (KR'16), Apr 2016, Cape Town, South Africa. pp.166-175. ⟨hal-01501680⟩