Many-to-one matchings without substitutability
From MaRDI portal
(Redirected from Many-to-one matchings without substitutability)
Recommendations
- The College Admissions Problem Revisited
- Matching with preferences over colleagues solves classical matching
- The college admissions problem is not equivalent to the marriage problem
- Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
- The college admissions problem with lower and common quotas
Cites work
- A solution to matching with preferences over colleagues
- College Admissions and the Stability of Marriage
- College applications and the effect of affirmative action
- scientific article; zbMATH DE number 48303 (Why is no real title available?)
- Job Matching, Coalition Formation, and Gross Substitutes
- Stability and preference alignment in matching and coalition formation
- Stability of matchings when individuals have preferences over colleagues
- Unravelling in two-sided matching markets and similarity of preferences
Cited in
(7)- The law of aggregate demand and welfare in the two-sided matching market
- A modified deferred acceptance algorithm for conditionally lexicographic-substitutable preferences
- Matching with preferences over colleagues solves classical matching
- Hedonic games related to many-to-one matching problems
- Unilateral substitutability implies substitutable completability in many-to-one matching with contracts
- College admissions with budget complementarities
- The college admissions problem with lower and common quotas
This page was built for publication: Many-to-one matchings without substitutability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1668291)
