We analyze the core of a class of coalition formation game in which every player's payoff depends only on the members of her coalition. We first consider anonymous games and additively separable games. Neither of these strong properties guarantee the existence of a core allocation, even if additional strong properties are imposed. We then introduce two top-coalition properties each of which guarantee the existence. We show that these properties are independent of the Scarf-balancedness condition. Finally we give several economic applications.
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.
Length: 19 pages Date of creation: 01 Dec 1999 Date of revision: Publication status: published, Social Choice and Welfare 18, 135-153, (2001). Handle: RePEc:boc:bocoec:449
Contact details of provider: Postal: Boston College, 140 Commonwealth Avenue, Chestnut Hill MA 02467 USA Phone: 617-552-3670 Fax: +1-617-552-2308 Email: Web page: http://fmwww.bc.edu/EC/ More information through EDIRC
For technical questions regarding this item, or to correct its listing, contact: (Christopher F Baum).
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.:
Gary S. Becker, 1974.
"A Theory of Marriage: Part II,"
NBER Chapters,
in: Marriage, Family, Human Capital, and Fertility, pages 11-26
National Bureau of Economic Research, Inc.
[Downloadable!]
Dutta, Bhaskar & Mutuswami, Suresh, 1996.
"Stable Networks,"
Working Papers
971, California Institute of Technology, Division of the Humanities and Social Sciences.
[Downloadable!]
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.) This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page.