Thomas Quint () (University of Nevada, Reno) Jun Wako () (Gakushuin University)
Abstract
We consider the n-player houseswapping game of Shapley-Scarf (1974), with indfferences in preferences allowed. It is well-known that the strict core of such a game may be empty, single-valued, or multi-valued. We define a condition on such games called "segmentability", which means that the set of players can be partitioned into a "top trading segmentation". It generalizes Gale's well-known idea of the partition of players into "top trading cycles" (which is used to find the unique strict core allocation in the model with no indifference). We prove that a game has a nonempty strict core if and only if it is segmentable. We then use this result to devise and O(n^3) algorithm which takes as input any houseswapping game, and returns either a strict core allocation or a report that the strict core is empty. Finally, we are also able to construct a linear inequality system whose feasible region's extreme points precisely correspond to the allocations of the strict core. This last result parallels the results of Vande Vate (1989) and Rothbum (1991) for the marriage game of Gale and Shapley (1962).
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.
Find related papers by JEL classification: C60 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - General C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
This paper has been announced in the following NEP Reports:
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.)