Core Many-to-One Matchings by Fixed-Point Methods
Posted: 18 Apr 2005
Abstract
We characterize the core many-to-one matchings as fixed points of a map. Our characterization gives an algorithm for finding core allocations; the algorithm is efficient and simple to implement. Our characterization does not require substitutable preferences, so it is separate from the structure needed for the non-emptiness of the core. When preferences are substitutable, our characterization gives a simple proof of the lattice structure of core matchings, and it gives a method for computing the join and meet of two core matchings.
Keywords: Matching, Core, Lattice, Stability, Algorithm, Complexity
JEL Classification: C78
Suggested Citation: Suggested Citation
Echenique, Federico and Oviedo, Jorge, Core Many-to-One Matchings by Fixed-Point Methods. Available at SSRN: https://ssrn.com/abstract=691382
Feedback
Feedback to SSRN
If you need immediate assistance, call 877-SSRNHelp (877 777 6435) in the United States, or +1 212 448 2500 outside of the United States, 8:30AM to 6:00PM U.S. Eastern, Monday - Friday.