A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
This paper considers a decentralized process in many-to-many matching problems. We show that if agents in one side of the market have substitutable preferences and those in the other side have responsive preferences, then there exists a finite path of matchings such that (i) each matching in the path is formed by satisfying a blocking individual or a blocking pair for the previous matching and (ii) the final matching is pairwise-stable. This implies that an associated stochastic processdoi:10.2139/ssrn.888640 fatcat:62ulsn6pi5gcbixzx4bat7xo4a