Abstract

http://ssrn.com/abstract=888640
 


 



Random Paths to Pairwise Stability in Many-to-Many Matching Problems: A Study on Market Equilibration


Fuhito Kojima


Harvard University - Department of Economics

M. Utku Ünver


Boston College - Department of Economics

August 2006


Abstract:     
This paper considers a decentralized process in many-to-many matching problems. We show that if agents on one side of the market have substitutable preferences and those on the other side have responsive preferences, then, from an arbitrary matching, there exists a finite path of matchings such that each matching on the path is formed by satisfying a blocking individual or a blocking pair for the previous matching, and the final matching is pairwise-stable. This implies that an associated stochastic process converges to a pairwise-stable matching in finite time with probability one, if each blocking individual or pair is satisfied with a positive probability at each period along the process.

Number of Pages in PDF File: 20

Keywords: Many-to-many matching, pairwise stability, stability, random paths

JEL Classification: C71, C78

working papers series


Download This Paper

Date posted: March 9, 2006  

Suggested Citation

Kojima, Fuhito and Ünver, M. Utku, Random Paths to Pairwise Stability in Many-to-Many Matching Problems: A Study on Market Equilibration (August 2006). Available at SSRN: http://ssrn.com/abstract=888640 or http://dx.doi.org/10.2139/ssrn.888640

Contact Information

Fuhito Kojima
Harvard University - Department of Economics ( email )
Littauer Center
Cambridge, MA 02138
United States
Utku Unver (Contact Author)
Boston College - Department of Economics ( email )
140 Commonwealth Ave.
Chestnut Hill, MA 02467
United States
+1 (617) 552 2217 (Phone)
+1 (617) 552 2318 (Fax)
HOME PAGE: http://www2.bc.edu/~unver
Feedback to SSRN


Paper statistics
Abstract Views: 2,138
Downloads: 254
Download Rank: 69,025

© 2014 Social Science Electronic Publishing, Inc. All Rights Reserved.  FAQ   Terms of Use   Privacy Policy   Copyright   Contact Us
This page was processed by apollo4 in 0.406 seconds