Corpus ID: 237571906

Constrained School Choice with Incomplete Information

@article{Gimbert2021ConstrainedSC,
  title={Constrained School Choice with Incomplete Information},
  author={Hugo Gimbert and Claire Mathieu and Simon Mauras},
  journal={ArXiv},
  year={2021},
  volume={abs/2109.09089}
}
School choice is the two-sided matching market where students (on one side) are to be matched with schools (on the other side) based on their mutual preferences. The classical algorithm to solve this problem is the celebrated deferred acceptance procedure, proposed by Gale and Shapley. After both sides have revealed their mutual preferences, the algorithm computes an optimal stable matching. Most often in practice, notably when the process is implemented by a national clearinghouse and… Expand

Figures from this paper

References

SHOWING 1-10 OF 26 REFERENCES
Incentives in Large Random Two-Sided Markets
TLDR
It is shown that in a probabilistic setting where the preference lists on one side of the market are composed of only a constant number of entries, each drawn from an arbitrary distribution, the number of participants that have more than one stable partner is vanishingly small. Expand
Constrained school choice
TLDR
This work studies the preference revelation game where students can only declare up to a fixed number of schools to be acceptable and identifies rather stringent necessary and sufficient conditions on the priorities to guarantee stability or efficiency of either of the two mechanisms. Expand
The Economics of Matching: Stability and Incentives
  • A. Roth
  • Mathematics, Computer Science
  • Math. Oper. Res.
  • 1982
TLDR
The main focus of this paper is on determining the extent to which matching procedures can be designed which give agents the incentive to honestly reveal their preferences, and which produce stable matches. Expand
Incomplete information and singleton cores in matching markets
TLDR
It is shown that truth-telling is an ordinal Bayesian Nash equilibrium of the revelation game induced by a common belief and a stable mechanism if and only if all the profiles in the support of the common belief have singleton cores. Expand
Implementation of stable solutions in a restricted matching market
Abstract. I analyze the admission mechanism used in Spanish universities. The system is open to strategic manipulation. This is because students are not allowed to express the whole list of availableExpand
The Uniqueness of Stable Matchings
This paper analyses conditions on agents' preferences for a unique stable matching in models of two-sided matching with non-transferable utility. The No Crossing Condition (NCC) is sufficient forExpand
Constrained School Choice: An Experimental Study
The literature on school choice assumes that families can submit a preference list over all the schools they want to be assigned to. However, in many real-life instances families are only allowed toExpand
School Choice in Chile
TLDR
This paper reports the design and implementation of the newly established school choice mechanism in Chile, where over 274,000 students applied to more than 6,400 schools, and develops a model based on the celebrated Deferred Acceptance algorithm. Expand
Randomness and Fairness in Two-Sided Matching with Limited Interviews
TLDR
The main findings are that in markets where jobs can only consider a limited number of candidates for interview, it increases the size of the resulting matching if the system has a limit on the number of applications a candidate can send and that these findings extend to markets where rankings become correlated after the interviews. Expand
Exchange-proofness or divorce-proofness? Stability in one-sided matching markets
Two stability concepts for one-sided matching markets are analyzed: Gale-Shapley stability and ξ-stability. The first one applies best to markets where no status quo allocation is considered, whereasExpand
...
1
2
3
...