COWLES FOUNDATION FOR RESEARCH IN
ECONOMICS Box 208281
COWLES FOUNDATION DISCUSSION PAPER NO. 620 "Cores of Partitioning Games" Mamoru Kaneko and Myrna Holtz Wooders February 1982 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. See CFP 566 |