Boolean Hedonic Games
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 pr...
| Main Authors: | , , , |
|---|---|
| Format: | Conference item |
| Published: |
Association for the Advancement of Artificial Intelligence
2016
|
| _version_ | 1826283494197690368 |
|---|---|
| author | Aziz, H Harrenstein, P Lang, J Wooldridge, M |
| author_facet | Aziz, H Harrenstein, P Lang, J Wooldridge, M |
| author_sort | Aziz, H |
| collection | OXFORD |
| description | 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. |
| first_indexed | 2024-03-07T00:59:43Z |
| format | Conference item |
| id | oxford-uuid:894cf3d8-a41d-4006-bfcb-a695273054aa |
| institution | University of Oxford |
| last_indexed | 2024-03-07T00:59:43Z |
| publishDate | 2016 |
| publisher | Association for the Advancement of Artificial Intelligence |
| record_format | dspace |
| spelling | oxford-uuid:894cf3d8-a41d-4006-bfcb-a695273054aa2022-03-26T22:23:34ZBoolean Hedonic GamesConference itemhttp://purl.org/coar/resource_type/c_5794uuid:894cf3d8-a41d-4006-bfcb-a695273054aaSymplectic Elements at OxfordAssociation for the Advancement of Artificial Intelligence2016Aziz, HHarrenstein, PLang, JWooldridge, MWe 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. |
| spellingShingle | Aziz, H Harrenstein, P Lang, J Wooldridge, M Boolean Hedonic Games |
| title | Boolean Hedonic Games |
| title_full | Boolean Hedonic Games |
| title_fullStr | Boolean Hedonic Games |
| title_full_unstemmed | Boolean Hedonic Games |
| title_short | Boolean Hedonic Games |
| title_sort | boolean hedonic games |
| work_keys_str_mv | AT azizh booleanhedonicgames AT harrensteinp booleanhedonicgames AT langj booleanhedonicgames AT wooldridgem booleanhedonicgames |