The College Admissions Problem Revisited

From MaRDI portal
Publication:3821889

DOI10.2307/1911052zbMath0668.90004OpenAlexW2039554452MaRDI QIDQ3821889

Marilda Sotomayor, Alvin E. Roth

Publication date: 1989

Published in: Econometrica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1911052




Related Items

Some remarks on the modeling of discrete matching marketsA coloring property for stable allocationsStability Representations of Many-to-One Matching Problems: An Integer Optimization ApproachDecision-making with reference informationManipulability in matching markets: conflict and coincidence of interestsOn the exhaustiveness of truncation and dropping strategies in many-to-many matching marketsA binomial decision tree to manage <scp>yield‐uncertainty</scp> in <scp>multi‐round</scp> academic admissions processesBalancing stability and efficiency in team formation as a generalized roommate problemUnnamed ItemSocial coordination and network formation in bipartite networksGames of capacity manipulation in hospital-intern marketsOn Marilda Sotomayor's extraordinary contribution to matching theoryWhy do stable clearinghouses work so well? -- Small sets of stable matchings in typical environments, and the limits-on-manipulation theorem of Demange, Gale and SotomayorStable schedule matching under revealed preference.On the stable \(b\)-matching polytope.Equilibria under deferred acceptance: dropping strategies, filled positions, and welfareStrategyproof exchange of indivisible goods.Entering classes in the college admissions modelEquivalences between two matching models: stabilityA unified approach to finding good stable matchings in the hospitals/residents settingA further note on the college admission gameTwo-Sided Matching ModelsCharacterizations of the optimal stable allocation mechanismGraduate admission with financial supportMinimal envy and popular matchingsThe stability of the equilibrium outcomes in the admission games induced by stable matching rulesDeferred acceptance algorithms: history, theory, practice, and open questionsThe singleton core in the college admissions problem and its application to the national resident matching program (NRMP)Median stable matching for college admissionsSmith and Rawls share a room: stability and mediansUnnamed ItemSingle agents and the set of many-to-one stable matchingsDeferred acceptance algorithm with retrade