• Corpus ID: 238259056

Capacity Expansion in the College Admission Problem

@article{Bobbio2021CapacityEI,
  title={Capacity Expansion in the College Admission Problem},
  author={Federico Bobbio and Margarida Carvalho and Andrea Lodi and Alfredo Torrico},
  journal={ArXiv},
  year={2021},
  volume={abs/2110.00734}
}
The college admission problem plays a fundamental role in several real-world allocation mechanisms such as school choice and supply chain stability. The classical framework assumes that the capacity of each college is known and fixed in advance. However, increasing the quota of even a single college would improve the overall cost of the students. In this work, we study the problem of finding the college capacity expansion that achieves the best cost of the students, subject to a cardinality… 

Figures and Tables from this paper

Capacity Variation in the Many-to-one Stable Matching
The many-to-one stable matching problem provides the fundamental abstraction of several real-world matching markets such as school choice and hospital-resident allocation. The agents on both sides
Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
TLDR
The first interactive oracle proofs of proximity (IOPP) for tensor products of Reed-Solomon codes and for Reed-Muller codes (evaluation of polynomials with bounds on individual degrees) are presented.

References

SHOWING 1-10 OF 38 REFERENCES
Integer programming methods for special college admissions problems
We develop integer programming (IP) solutions for some special college admission problems arising from the Hungarian higher education admission scheme. We focus on four special features, namely the
Stable Matchings, Optimal Assignments, and Linear Programming
TLDR
It is shown that those fractional matchings in the Stable Marriage Polytope form a lattice with respect to a partial ordering that involves stochastic dominance, and all expected utility functions corresponding to the same ordinal preferences will agree on the relevant comparisons.
The Daycare Assignment Problem
In this paper we take the mechanism design approach to the problem of assigning children of different ages to daycares, motivated by the mechanism currently in place in Denmark. This problem is
Implications of capacity reduction and entry in many-to-one stable matching
TLDR
Assuming preferences are strict and responsive, comparative statistics involving subsets of agents on both sides of the market for all stable mechanisms are provided, and truncation strategies are considered, and how agents may manipulate the matching process to their advantage.
Analysis of the Chinese college admission system
TLDR
A model is constructed to reveal the forces that positively sort students into different quality universities in a free choice system under assumptions of supermodular utility and production functions and concludes that the exam system is superior to the market system if the authors only consider the issue of corruption.
The Stable marriage problem - structure and algorithms
TLDR
The authors develop the structure of the set of stable matchings in the stable marriage problem in a more general and algebraic context than has been done previously; they discuss the problem's structure in terms of rings of sets, which allows many of the most useful features to be seen as features of a moregeneral set of problems.
An Integer Programming Approach to the Hospitals/Residents Problem with Ties
TLDR
An Integer Programming (IP) model for MAX HRT, the problem of finding a maximum cardinality stable matching, is NP-hard is described and results obtained from an empirical evaluation of the IP model based on real-world and randomly generated problem instances are presented.
Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications
TLDR
The optimal cheating strategy is derived and it is shown that it is not always possible for a woman to recover her women-optimal stable partner from the men-Optimal stable matching mechanism when she can only cheat by permuting her preferences.
Hard variants of stable marriage
Changing the Boston School Choice Mechanism
In July 2005 the Boston School Committee voted to replace the existing Boston school choice mechanism with a deferred acceptance mechanism that simplifies the strategic choices facing parents. This
...
...