Matching in Networks with Bilateral Contracts
We 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 are guaranteed to exist. Furthermore, the classical lattice structure, rural hospitals theorem, and one-sided strategy-proofness results all generalize to this setting. (JEL C78, D85, D86, L14)
If 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.
Volume (Year): 4 (2012)
Issue (Month): 1 (February)
|Contact details of provider:|| Web page: https://www.aeaweb.org/aej-micro|
More information through EDIRC
|Order Information:||Web: https://www.aeaweb.org/subscribe.html|
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.:
- Hatfield, John William & Kojima, Fuhito, 2010. "Substitutes and stability for matching with contracts," Journal of Economic Theory, Elsevier, vol. 145(5), pages 1704-1723, September.
- Mas-Colell, Andreu & Whinston, Michael D. & Green, Jerry R., 1995. "Microeconomic Theory," OUP Catalogue, Oxford University Press, number 9780195102680, March.
- Alkan, Ahmet & Gale, David, 2003. "Stable schedule matching under revealed preference," Journal of Economic Theory, Elsevier, vol. 112(2), pages 289-306, October.
- Roth, Alvin E., 1985. "The college admissions problem is not equivalent to the marriage problem," Journal of Economic Theory, Elsevier, vol. 36(2), pages 277-288, August.
- John William Hatfield & Fuhito Kojima, 2008. "Matching with Contracts: Comment," American Economic Review, American Economic Association, vol. 98(3), pages 1189-94, June.
- Kojima, Fuhito, 2008. "The law of aggregate demand and welfare in the two-sided matching market," Economics Letters, Elsevier, vol. 99(3), pages 581-584, June.
- Milgrom,Paul, 2004.
"Putting Auction Theory to Work,"
Cambridge University Press, number 9780521551847.
- Alexander Westkamp, 2010. "Market Structure and Matching with Contracts," Bonn Econ Discussion Papers bgse02_2010, University of Bonn, Germany.
- Westkamp, Alexander, 2010. "Market structure and matching with contracts," Journal of Economic Theory, Elsevier, vol. 145(5), pages 1724-1738, September.
- Alvin Roth, 2008.
"Deferred acceptance algorithms: history, theory, practice, and open questions,"
International Journal of Game Theory,
Springer, vol. 36(3), pages 537-569, March.
- Alvin E Roth, 2007. "Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions," Levine's Bibliography 843644000000000283, UCLA Department of Economics.
- Roth, Alvin, 2008. "Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions," Scholarly Articles 2579651, Harvard University Department of Economics.
- Alvin E. Roth, 2007. "Deferred Acceptance Algorithms: History, Theory, Practice, and Open Questions," NBER Working Papers 13225, National Bureau of Economic Research, Inc.
- 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.
- Sotomayor, Marilda, 2004. "Implementation in the many-to-many matching market," Games and Economic Behavior, Elsevier, vol. 46(1), pages 199-212, January.
- John William Hatfield & Scott Duke Kominers & Alexandru Nichifor & Michael Ostrovsky & Alexander Westkamp, 2013. "Stability and Competitive Equilibrium in Trading Networks," Journal of Political Economy, University of Chicago Press, vol. 121(5), pages 966 - 1005.
- Roth, Alvin E, 1984. "Stability and Polarization of Interests in Job Matching," Econometrica, Econometric Society, vol. 52(1), pages 47-57, January.
- Crawford, Vincent P & Knoer, Elsie Marie, 1981. "Job Matching with Heterogeneous Firms and Workers," Econometrica, Econometric Society, vol. 49(2), pages 437-50, March.
When requesting a correction, please mention this item's handle: RePEc:aea:aejmic:v:4:y:2012:i:1:p:176-208. 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: (Jane Voros)or (Michael P. Albert)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.