This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Stability in Supply Chain Networks

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Michael Ostrovsky

Additional information is available for the following registered author(s):

Abstract

This paper studies matching in vertical networks, generalizing the theory of matching in two-sided markets. It gives sufficient conditions for the existence of stable networks and presents an algorithm for finding two of them. One is the best stable network for the agents on the "upstream" end of an industry. The other is best for the agents on the "downstream" end. The paper describes several properties of the set of stable networks and discusses applications of the theory to the design of matching markets with more than two types of agents and to the empirical analysis of supply chains.

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.

File URL: http://hdl.handle.net/10.1257/aer.98.3.897
File Format: text/html
File Function:
Download Restriction: no
File URL: http://www.aeaweb.org/articles/article_detail.php?journal=AER&volume=98&issue=3&article=14&issue_date=June2008
File Format: application/pdf
File Function:
Download Restriction: Access to full text is restricted to AEA members.

Publisher Info
Article provided by American Economic Association in its journal American Economic Review.

Volume (Year): 98 (2008)
Issue (Month): 3 (June)
Pages: 897-923
Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Handle: RePEc:aea:aecrev:v:98:y:2008:i:3:p:897-923

Contact details of provider:
Email:
Web page: http://www.aeaweb.org/aer/
More information through EDIRC

Order Information:
Web: http://www.aeaweb.org/subscribe.html

For technical questions regarding this item, or to correct its listing, contact: (Christopher F. Baum).

Related research
Keywords:

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.)

  1. Aron Matskin & Daniel Lehmann, 2009. "General Matching: Lattice Structure of the Set of Agreements," Discussion Paper Series dp501, Center for Rationality and Interactive Decision Theory, Hebrew University, Jerusalem. [Downloadable!]
  2. 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. [Downloadable!] (restricted)
    Other versions:
  3. Jeremy T. Fox, 2009. "Identification in Matching Games," NBER Working Papers 15092, National Bureau of Economic Research, Inc. [Downloadable!] (restricted)
  4. Jeremy T. Fox, 2008. "Estimating Matching Games with Transfers," NBER Working Papers 14382, National Bureau of Economic Research, Inc. [Downloadable!] (restricted)
  5. Federico Echenique, 2005. "A Solution to Matching with Preferences over Colleagues," Game Theory and Information 0506005, EconWPA. [Downloadable!]
    Other versions:
Statistics
Access and download statistics

Did you know? IDEAS was sponsored from 1997 to 2002 by the Université du Québec à Montréal.

This page was last updated on 2009-11-16.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.