We develop a theory of stability in many-to-many matching markets. We give conditions under which the setwise-stable set, a core-like concept, is nonempty and can be approached through an algorithm. The usual core may be empty. The setwise-stable set coincides with the pairwise-stable set and with the predictions of a non-cooperative bargaining model. The… (More)
Some properties of the set of many-to-one stable matchings for firms that have responsive preferences and quotas are not necessarily true when firms' preferences are substitutable. In particular, we provide examples in which firms have sub-stitutable preferences but firms and workers may bè`single'' in one stable matching and matched in another one. We… (More)
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… (More)
* We are grateful to a referee of this journal for helpful comments and suggestions. through grant 2001SGR-00162 and the Barcelona Economics Program (CREA). The paper was partially written while J. Massó was visiting the Universidad Carlos III de Madrid and A. Neme was visiting the Universitat Autònoma de Barcelona. They acknowledge the hospitality of their… (More)
Outdoor carbon monoxide comes mainly from vehicular emissions, and high concentrations occur in areas with heavy traffic congestion. CO binds to hemoglobin, forming carboxyhemoglobin (COHb), and reduces oxygen delivery. We investigated the link between the adverse effects of CO on the respiratory system using COHb as a marker for chronic CO exposure. We… (More)
For the many-to-one matching model we give a procedure to partition the set of substitutable preference pro…les into equivalence classes with the property that all pro…les in the same class have the same set of stable match-ings. This partition allows to reduce the amount of information required by centralized stable mechanisms.
We consider the general many-to-one matching model with ordinal preferences and give a procedure to partition the set of preference pro…les into subsets with the property that all preference pro…les in the same subset have the same Core. We also show how to identify a pro…le of (incomplete) binary relations containing the minimal information needed to… (More)