We consider hedonic games with separable preferences, and explore the existence of stable coalition structures if only individual deviations are allowed. For two natural subdomains of separable preferences, namely preference domains based on (1) aversion to enemies and (2) appreciation of friends, we show that an individually stable coalition structure always exist, and a Nash stable coalition structure exists when mutuality is imposed. Moreover, we show that on the domain of separable preferences a contractual individually stable coalition structure can be obtained in polynomial time. Finally, we prove that, on each of the two subdomains, the corresponding algorithm that we use for finding Nash stable and individually stable coalition structures turns out to be strategy-proof.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number
111.
For technical questions regarding this item, or to correct its listing, contact: (Corry Stuyts).
Related research
Keywords:
Other versions of this item:
Find related papers by JEL classification: A14 - General Economics and Teaching - - General Economics - - - Sociology of Economics C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games D20 - Microeconomics - - Production and Organizations - - - General
This paper has been announced in the following NEP Reports:
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)