Strategy-proof school choice mechanisms with minimum quotas and initial endowments.

Artificial Intelligence(2017)

引用 37|浏览22
暂无评分
摘要
We consider a school choice program where minimum quotas are imposed for each school, i.e., a school must be assigned at least a certain number of students to operate. We require that the obtained matching must respect the initial endowments, i.e., each student must be assigned to a school that is at least as good as her initial endowment school. Although minimum quotas are relevant in school choice programs and strategy-proofness is important to many policymakers, few existing mechanisms simultaneously achieve both. One difficulty is that no strategy-proof mechanism exists that is both efficient and fair under the presence of minimum quotas. Furthermore, existing mechanisms require that all students consider all schools acceptable to obtain a feasible matching that respects minimum quotas. This assumption is unrealistic in a school choice program.
更多
查看译文
关键词
Matching theory,Market design,School choice,Minimum quotas,Strategy-proofness,Top Trading Cycles mechanism,Deferred Acceptance mechanism
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要