Bertrand competition with intertemporal demand
AbstractThis paper studies whether a sequence of myopic blockings leads to a stable matching in the roommate problem. We prove that if a stable matching exists and preferences are strict, then for any unstable matching, there exists a finite sequence of successive myopic blockings leading to a stable matching. This implies that, starting from any unstable matching, the process of allowing a randomly chosen blocking pair to form converges to a stable matching with probability one. This result generalizes those of Roth and Vande Vate (1990) and Chung (2000)under strict preferences.
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 Columbia University, Department of Economics in its series Discussion Papers with number 0102-17.
Length: 23 pages
Date of creation: 2002
Date of revision:
Contact details of provider:
Postal: 1022 International Affairs Building, 420 West 118th Street, New York, NY 10027
Phone: (212) 854-3680
Fax: (212) 854-8059
Web page: http://www.econ.columbia.edu/
More information through EDIRC
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Discussion Paper Coordinator).
If references are entirely missing, you can add them using this form.