Core of the assignment game via fixed point methods
AbstractAbstract This paper shows that the core outcomes of the assignment game coincides with the set of fixed points of a certain function. The lattice property of the core, as well as its non-emptiness, are proved using Tarski's fixed point theorem.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Journal of Mathematical Economics.
Volume (Year): 47 (2011)
Issue (Month): 1 (January)
Contact details of provider:
Web page: http://www.elsevier.com/locate/jmateco
Two-sided matching Assignment game Stability Core Lattice structure;
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.:
- Federico Echenique, 2003.
"A Short And Constructive Proof of Tarski's Fixed-Point Theorem,"
GE, Growth, Math methods
- Federico Echenique, 2005. "A short and constructive proof of Tarski’s fixed-point theorem," International Journal of Game Theory, Springer, vol. 33(2), pages 215-218, 06.
- Echenique, Federico & Oviedo, Jorge, 2002.
"Core Many-To-One Matchings by Fixed-Point Methods,"
1140, California Institute of Technology, Division of the Humanities and Social Sciences.
- Adachi, Hiroyuki, 2000. "On a characterization of stable matchings," Economics Letters, Elsevier, vol. 68(1), pages 43-49, July.
- Nunez, Marina & Rafels, Carles, 2003. "Characterization of the extreme core allocations of the assignment game," Games and Economic Behavior, Elsevier, vol. 44(2), pages 311-331, August.
- Federico Echenique, 2005.
"A Solution to Matching with Preferences over Colleagues,"
Game Theory and Information
- Echenique, Federico & Yenmez, M. Bumin, 2007. "A solution to matching with preferences over colleagues," Games and Economic Behavior, Elsevier, vol. 59(1), pages 46-71, April.
- Echenique, Federico & Yenmez, Mehmet B., 2005. "A Solution to Matching with Preferences over Colleagues," Working Papers 1226, California Institute of Technology, Division of the Humanities and Social Sciences.
- Federico Echenique & Mehmet B. Yenmez, 2005. "A Solution to Matching with Preferences over Colleagues," Working Papers 2005.120, Fondazione Eni Enrico Mattei.
- Hamers, H.J.M. & Klijn, F. & Solymosi, T. & Tijs, S.H. & Pere Villar, J., 2002.
"Assignment games satisfy the CoMa property,"
Open Access publications from Tilburg University
urn:nbn:nl:ui:12-91410, Tilburg University.
- Paul Milgrom, 2003.
"Matching with Contracts,"
03003, Stanford University, Department of Economics.
- Adachi, Hiroyuki, 2003. "A search model of two-sided matching under nontransferable utility," Journal of Economic Theory, Elsevier, vol. 113(2), pages 182-198, December.
- Rochford, Sharon C., 1984. "Symmetrically pairwise-bargained allocations in an assignment market," Journal of Economic Theory, Elsevier, vol. 34(2), pages 262-281, December.
- Marilda Sotomayor, 1999. "The lattice structure of the set of stable outcomes of the multiple partners assignment game," International Journal of Game Theory, Springer, vol. 28(4), pages 567-583.
- Michael Ostrovsky, 2008. "Stability in Supply Chain Networks," American Economic Review, American Economic Association, vol. 98(3), pages 897-923, June.
- Roth, Alvin E. & Sotomayor, Marilda, 1988. "Interior points in the core of two-sided matching markets," Journal of Economic Theory, Elsevier, vol. 45(1), pages 85-101, June.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.