College admissions with ties and common quotas: integer programming approach
type: Item
instance of: scholarly article
title: College admissions with ties and common quotas: integer programming approach
zbMATH Open document ID: 1490.91139
author: Kolos Csaba Ágoston
author: Péter Biró
author: Endre Kováts
author: Zsuzsanna Jankó
published in: European Journal of Operational Research
publication date: 2022-02-23T00:00:00Z
Mathematics Subject Classification ID: 91B68
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 7479770
zbMATH Keywords: assignment
zbMATH Keywords: stable matching
zbMATH Keywords: college admission
zbMATH Keywords: distributional constraints
zbMATH Keywords: integer programming
MaRDI profile type: Publication
full work available at URL: j.ejor.2021.08.033
OpenAlex ID: W3196438934
cites work: College admissions with affirmative action
cites work: Integer programming methods for special college admissions problems
cites work: The stable admissions polytope
cites work: The college admissions problem with lower and common quotas
cites work: College admissions with stable score-limits
cites work: Fair implementation of diversity in school choice
cites work: Optimizing the marriage market: an application of the linear assignment model
cites work: Mathematical models for stable matching problems with ties and incomplete lists
cites work: Matching with indifferences: a comparison of algorithms in the context of course allocation
cites work: School choice with controlled choice constraints: hard bounds versus soft bounds
cites work: Choice function-based two-sided markets: stability, lattice property, path independence and algorithms
cites work: College Admissions and the Stability of Marriage
cites work: Assigning papers to referees
cites work: Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
cites work: Stability concepts in matching under distributional constraints
cites work: Algorithmics of Matching Under Preferences
cites work: Assignment problems: a golden anniversary survey
cites work: Q3999327
cites work: The lattice of envy-free matchings
cites work: Envy-free matchings with lower quotas
DOI: 10.1016/J.EJOR.2021.08.033
Recommended article: Q5228218
Recommended article: Integer programming methods for special college admissions problems
Recommended article: Integer Programming Methods for Special College Admissions Problems
Recommended article: The college admissions problem with lower and common quotas
Recommended article: Q4443977
Recommended article: Random matching in the college admissions problem
Recommended article: The College Admissions Problem Revisited
Recommended article: College assignment problems under constrained choice, private preferences, and risk aversion
Recommended article: Sequential decisions in the college admissions problem
Recommended article: Simple mechanisms to implement the core of college admissions problems
description: scientific article; zbMATH DE number 7479770