Core Many-to-One Matchings by Fixed-Point Methods

Posted: 18 Apr 2005

See all articles by Federico Echenique

Federico Echenique

California Institute of Technology - Division of the Humanities and Social Sciences

Jorge Oviedo

Universidad Nacional de San Luis

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

Echenique, Federico and Oviedo, Jorge, Core Many-to-One Matchings by Fixed-Point Methods. Available at SSRN: https://ssrn.com/abstract=691382

Federico Echenique (Contact Author)

California Institute of Technology - Division of the Humanities and Social Sciences ( email )

313 Baxter Hall
Pasadena, CA 91125
United States

Jorge Oviedo

Universidad Nacional de San Luis ( email )

Ejercito de los Andes 950
D5700HHW - San Luis
Argentina

Do you have negative results from your research you’d like to share?

Paper statistics

Abstract Views
692
PlumX Metrics