A many-to-many `rural hospital theorem'
From MaRDI portal
Publication:462856
DOI10.1016/j.jmateco.2014.09.003zbMath1308.91121OpenAlexW1503583806MaRDI QIDQ462856
Publication date: 22 October 2014
Published in: Journal of Mathematical Economics (Search for Journal in Brave)
Full work available at URL: http://dro.dur.ac.uk/13457/1/13457.pdf
Related Items
Lone wolves in infinite, discrete matching markets ⋮ Strategy-proofness of worker-optimal matching with continuously transferable utility ⋮ Review of the theory of stable matchings and contract systems ⋮ On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets ⋮ Pareto stability in two-sided many-to-many matching with weak preferences ⋮ Equilibria under deferred acceptance: dropping strategies, filled positions, and welfare ⋮ Lone wolves in competitive equilibria ⋮ Existence of stable allocations in matching markets with infinite contracts: a topological approach ⋮ Implications of capacity reduction and entry in many-to-one stable matching ⋮ Probabilistic stable rules and Nash equilibrium in two-sided matching problems
Cites Work
- Unnamed Item
- Unnamed Item
- On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets
- On the correspondence of contracts to salaries in (many-to-many) matching
- Probabilistic stable rules and Nash equilibrium in two-sided matching problems
- Contract design and stability in many-to-many matching
- Stable many-to-many matchings with contracts
- The college admissions problem is not equivalent to the marriage problem
- Some remarks on the stable matching problem
- Three remarks on the many-to-many stable matching problem
- Stable schedule matching under revealed preference.
- Implementation in the many-to-many matching market.
- An algorithm to compute the full set of many-to-many stable matchings.
- Single agents and the set of many-to-one stable matchings
- A class of multipartner matching markets with a strong lattice structure
- On group strategy-proof mechanisms for a many-to-one matching model
- Stable matchings and the small core in Nash equilibrium in the college admissions problem.
- Substitutes and stability for matching with contracts
- Random matching in the college admissions problem
- Random paths to pairwise stability in many-to-many matching problems: a study on market equilibration
- Credible group stability in many-to-many matching problems
- Stability and Polarization of Interests in Job Matching
- The Lattice Structure of the Set of Stable Matchings with Multiple Partners
- Job Matching, Coalition Formation, and Gross Substitutes
- On the lattice structure of the set of stable matchings for a many-to-one model∗
- The “rural hospital theorem” revisited
- On preferences over subsets and the lattice structure of stable matchings
This page was built for publication: A many-to-many `rural hospital theorem'
