You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: University of Liverpool » Outputs » Detail

Output details

11 - Computer Science and Informatics

University of Liverpool

Return to search Previous output Next output

Output 21 of 94 in the submission

Output title

Computing Stable Outcomes in Hedonic Games

Type

E - Conference contribution

DOI

10.1007/978-3-642-16170-4_16

Name of conference/published proceedings

Proceedings of the Third International Symposium on Algorithmic Game Theory

Volume number

6386

Issue number

First page of article

174

ISSN of proceedings

1611-3349

Year of publication

2010

URL

Number of additional authors

Additional information

<12> This paper studies the computational complexity of finding stable outcomes in hedonic games, a well-studied model for coalition formation. The techniques in this paper have later been used by Feldman, Lewin-Eytan, and Naor (SPAA 2012). Moreover, our follow-on AAMAS 2011 paper builds entirely on the results from this paper. Together, our two papers provide a thorough characterisation of the tractability of computing stable outcomes in additively-separable hedonic games.

Interdisciplinary

Cross-referral requested

Research group

None

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract