THE TWO-SIDED MATCHING PROBLEM: ORIGIN, DEVELOPMENT AND CURRENT ISSUES
From MaRDI portal
Publication:2772855
DOI10.1142/S0219198901000373zbMath1127.91372OpenAlexW1985217798MaRDI QIDQ2772855
Publication date: 19 February 2002
Published in: International Game Theory Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219198901000373
Related Items (8)
Satisfied two-sided matching: a method considering elation and disappointment of agents ⋮ ReGale: some memorable results ⋮ A surgical scheduling method considering surgeons' preferences ⋮ Review of the theory of stable matchings and contract systems ⋮ A Note on a Two-Sided Discrete-Concave Market with Possibly Bounded Salaries ⋮ A number of stable matchings in models of the Gale-Shapley type ⋮ Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem ⋮ Bipartite choices
Cites Work
- Every finite distributive lattice is a set of stable matchings
- The college admissions problem is not equivalent to the marriage problem
- Some remarks on the stable matching problem
- The Lattice Structure of the Set of Stable Matchings with Multiple Partners
- Machiavelli and the Gale-Shapley Algorithm
- Graphs and Marriages
- College Admissions and the Stability of Marriage
This page was built for publication: THE TWO-SIDED MATCHING PROBLEM: ORIGIN, DEVELOPMENT AND CURRENT ISSUES
