Cores of Partitioning Games

Mamoru Kaneko () and Myrna Wooders

No 620, Cowles Foundation Discussion Papers from Cowles Foundation for Research in Economics, Yale University

Abstract: A generalization of assignment games, called partitioning games, is introduced. Given a finite set N of players, there is an a priori given subset pi of coalitions of N and only coalitions in pi play an essential role. Necessary and sufficient conditions for the non-emptiness of the cores of all games with essential coalitions pi are developed. These conditions appear extremely restrictive. However, when N is "large," there are relatively few "types" of players, and members of pi are "small" and defined in terms of numbers of players of each type contained in subsets, then approximate cores are non-empty.

Pages: 25 pages
Date: 1982-02
Note: CFP 566.
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (98)

Published in Mathematical Social Sciences (1982), 3: 313-327

Downloads: (external link)
https://cowles.yale.edu/sites/default/files/files/pub/d06/d0620.pdf (application/pdf)
Our link check indicates that this URL is bad, the error code is: 404 Not Found

Related works:
Journal Article: Cores of partitioning games (1982)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cwl:cwldpp:620

Ordering information: This working paper can be ordered from
Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA
The price is None.

Access Statistics for this paper

More papers in Cowles Foundation Discussion Papers from Cowles Foundation for Research in Economics, Yale University Yale University, Box 208281, New Haven, CT 06520-8281 USA. Contact information at EDIRC.
Bibliographic data for series maintained by Brittany Ladd ().