Matching Networks with Bilateral Contracts
AbstractWe introduce a model in which firms trade goods via bilateral contracts which specify a buyer, a seller, and the terms of the exchange. This setting subsumes (many-to- many) matching with contracts, as well as supply chain matching. When firms' relationships do not exhibit a supply chain structure, stable allocations need not exist. By contrast, in the presence of supply chain structure, a natural substitutability condition characterizes the maximal domain of firm preferences for which stable allocations always exist. Furthermore, the classical lattice structure, rural hospitals theorem, and one-sided strategy-proofness results all generalize to this setting.
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.
Bibliographic InfoPaper provided by Stanford University, Graduate School of Business in its series Research Papers with number 2050.
Date of creation: Feb 2010
Date of revision:
Contact details of provider:
Postal: Stanford University, Stanford, CA 94305-5015
Phone: (650) 723-2146
Web page: http://gsbapps.stanford.edu/researchpapers/
More information through EDIRC
This paper has been announced in the following NEP Reports:
- NEP-ALL-2010-06-04 (All new papers)
- NEP-GTH-2010-06-04 (Game Theory)
- NEP-MIC-2010-06-04 (Microeconomics)
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.:
- Roth, Alvin E, 1986. "On the Allocation of Residents to Rural Hospitals: A General Property of Two-Sided Matching Markets," Econometrica, Econometric Society, vol. 54(2), pages 425-27, March.
- Konishi, Hideo & Unver, M. Utku, 2006.
"Credible group stability in many-to-many matching problems,"
Journal of Economic Theory,
Elsevier, vol. 129(1), pages 57-80, July.
- Hideo Konishi & M. Utku Unver, 2003. "Credible Group-Stability in Many-to-Many Matching Problems," Boston College Working Papers in Economics 570, Boston College Department of Economics, revised 19 Jan 2005.
- Hideo Konishi & M. Utku Ünver, 2003. "Credible Group Stability in Many-to-Many Matching Problems," Game Theory and Information 0309005, EconWPA, revised 06 Sep 2003.
- Echenique, Federico & Oviedo, Jorge, 2006.
"A theory of stability in many-to-many matching markets,"
Econometric Society, vol. 1(2), pages 233-273, June.
- Echenique, Federico & Oviedo, Jorge, 2003. "A Theory of Stability in Many-to-Many Matching Markets," Working Papers 1185, California Institute of Technology, Division of the Humanities and Social Sciences.
- Jorge Oviedo & Federico Echenique, 2005. "A Theory of Stability in Many-to-Many Matching Markets," 2005 Meeting Papers 233, Society for Economic Dynamics.
- Federico Echenique & Jorge Oviedo, 2004. "A Theory of Stability in Many-to-many Matching Markets," Game Theory and Information 0401002, EconWPA.
- Federico Echenique & Jorge Oviedo, 2003. "A Theory of Stability in Many-to-many Matching Markets," Levine's Working Paper Archive 666156000000000374, David K. Levine.
- Chambers, Christopher P. & Echenique, Federico, 2009. "Supermodularity and preferences," Journal of Economic Theory, Elsevier, vol. 144(3), pages 1004-1014, May.
- Klaus, Bettina & Klijn, Flip, 2005.
"Stable matchings and preferences of couples,"
Journal of Economic Theory,
Elsevier, vol. 121(1), pages 75-106, March.
- Bettina Klaus & Flip Klijn, 2004. "Stable Matchings and Preferences of Couples," Working Papers 117, Barcelona Graduate School of Economics.
- Klaus, Bettina & Klijn, Flip, 2005. "Stable matchings and preferences of couples," Open Access publications from Maastricht University urn:nbn:nl:ui:27-20021, Maastricht University.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().
If references are entirely missing, you can add them using this form.