Bertrand competition with intertemporal demand
This 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.
|Date of creation:||2002|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: (212) 854-3680
Fax: (212) 854-8059
Web page: http://www.econ.columbia.edu/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:clu:wpaper:0102-17. 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: (Discussion Paper Coordinator)
If references are entirely missing, you can add them using this form.