Journal article icon

Journal article

Hedonic games with graph-restricted communication.

Abstract:

We study hedonic coalition formation games in which cooperation among the players is restricted by a graph structure: a subset of players can form a coalition if and only if they are connected in the given graph. We investigate the complexity of finding stable outcomes in such games, for several notions of stability. In particular, we provide an efficient algorithm that finds an individually stable partition for an arbitrary hedonic game on an acyclic graph. We also introduce a new stability...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Authors


More by this author
Department:
Oxford, Colleges and Halls, St Catherine's College
More by this author
Department:
Balliol College
Funai Foundation for Information Technology More from this funder
Publisher:
Association for Computing Machinery Publisher's website
Journal:
Proceedings of the 2016 International Conference on Autonomous Agents and Multiagent Systems Journal website
Publication date:
2016-05-05
Acceptance date:
2016-01-26
Pubs id:
pubs:628507
URN:
uri:971fa57a-67ee-4b4f-8645-69e5a6c6f5b3
UUID:
uuid:971fa57a-67ee-4b4f-8645-69e5a6c6f5b3
Local pid:
pubs:628507

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP