Random paths to stability in the roommate problem
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.
Year of publication: |
2002
|
---|---|
Authors: | Diamantoudi, Effrosyni ; Miyagawa, Eiichi ; Xue, Licun |
Institutions: | Department of Economics, School of Arts and Sciences |
Saved in:
freely available
Saved in favorites
Similar items by person
-
Random paths to stability in the roommate problem
Diamantoudi, Effrosyni, (2004)
-
Decentralized matching : the role of commitment
Diamantoudi, Effrosyni, (2015)
-
Random paths to stability in the roommate problem
Diamantoudi, Effrosyni, (2002)
- More ...