College admissions with ties and common quotas: integer programming approach

DOI10.1016/J.EJOR.2021.08.033MaRDI QIDQ2077946zbMATH OpenOpenAlexFDO

Authors Kolos Csaba Ágoston, Péter Biró, Endre Kováts, Zsuzsanna Jankó

Publication date 23 February 2022

Published in European Journal of Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/j.ejor.2021.08.033

zbMATH Keywords

assignmentcollege admissiondistributional constraintsinteger programmingstable matching

Mathematics Subject Classification ID

Integer programming (90C10) Matching models (91B68)

Recommendations

• Integer programming techniques for college admission problem with common quotas
• Integer programming methods for special college admissions problems
• Integer programming methods for special college admissions problems
• The college admissions problem with lower and common quotas
• scientific article; zbMATH DE number 2028680
• Random matching in the college admissions problem
• The College Admissions Problem Revisited
• College assignment problems under constrained choice, private preferences, and risk aversion
• Sequential decisions in the college admissions problem
• Simple mechanisms to implement the core of college admissions problems

Cites work

• Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
• Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
• Assigning papers to referees
• Assignment problems: a golden anniversary survey
• Choice function-based two-sided markets: stability, lattice property, path independence and algorithms
• College Admissions and the Stability of Marriage
• College admissions with affirmative action
• College admissions with stable score-limits
• Envy-free matchings with lower quotas
• Fair implementation of diversity in school choice
• scientific article; zbMATH DE number 48303 (Why is no real title available?)
• Integer programming methods for special college admissions problems
• Matching with indifferences: a comparison of algorithms in the context of course allocation
• Mathematical models for stable matching problems with ties and incomplete lists
• Optimizing the marriage market: an application of the linear assignment model
• School choice with controlled choice constraints: hard bounds versus soft bounds
• Stability concepts in matching under distributional constraints
• The college admissions problem with lower and common quotas
• The lattice of envy-free matchings
• The stable admissions polytope

Cited in

(12)

• Integer programming methods for special college admissions problems
• College admissions with stable score-limits
• Integer programming methods for special college admissions problems
• Improving the Chilean college admissions system
• Integer programming techniques for college admission problem with common quotas
• Strategyproof mechanism for two-sided matching with resource allocation
• Novel integer programming models for the stable kidney exchange problem
• Optimization methods and algorithms
• Comparison of a rule-based heuristic and a linear programming model for assigning mentees and mentors in a women in technology mentoring programme
• Equal treatment and its market design implications
• The singleton core in the college admissions problem and its application to the national resident matching program (NRMP)
• The college admissions problem with lower and common quotas

This page was built for publication: College admissions with ties and common quotas: integer programming approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2077946)