The core matchings of markets with transfers
We characterize the structure of the set of core matchings of an assignment game (a two-sided market with transfers). Such a set satisfies a property we call consistency. Consistency of a set of matchings states that, for any matching v, if, for each agent i there exists a matching ? in the set for which ?(i) = v(i), then v is in the set. A set of matchings satisfies consistency if and only if there is an assignment game for which all elements of the set maximize the surplus. (JEL C78)
(This abstract was borrowed from another version of this item.)
|Date of creation:||Oct 2008|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: 626 395-4065
Fax: 626 405-9841
Web page: http://www.hss.caltech.edu/ss
|Order Information:|| Postal: Working Paper Assistant, Division of the Humanities and Social Sciences, 228-77, Caltech, Pasadena CA 91125|
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.:
- Becker, Gary S, 1973. "A Theory of Marriage: Part I," Journal of Political Economy, University of Chicago Press, vol. 81(4), pages 813-46, July-Aug..
- Jun Wako, 2006. "Another proof that assignment games have singleton cores only if multiple optimal matchings exist," Economic Theory, Springer, vol. 29(1), pages 213-217, September.
When requesting a correction, please mention this item's handle: RePEc:clt:sswopa:1298. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Victoria Mason)
If references are entirely missing, you can add them using this form.