Lottery Design for School Choice

Manag. Sci. Pub Date : 2022-06-01 DOI:10.1287/mnsc.2022.4338
N. Arnosti
{"title":"Lottery Design for School Choice","authors":"N. Arnosti","doi":"10.1287/mnsc.2022.4338","DOIUrl":null,"url":null,"abstract":"This paper studies outcomes of the deferred acceptance algorithm in large random matching markets where priorities are generated either by a single lottery or by independent lotteries. In contrast to prior work, my model permits students to submit lists of varying lengths and schools to vary in their popularity and number of seats. In a limiting regime where the number of students and schools grow while the length of student lists and number of seats at each school remain bounded, I provide exact expressions for the number of students who list l schools and match to one of their top k choices, for each [Formula: see text]. These expressions provide three main insights. First, there is a persistent tradeoff between using a single lottery and independent lotteries. For students who submit short lists, the rank distribution under a single lottery stochastically dominates the corresponding distribution under independent lotteries. However, the students who submit the longest lists are always more likely to match when schools use independent lotteries. Second, I compare the total number of matches in the two lottery systems, and find that the shape of the list length distribution plays a key role. If this distribution has an increasing hazard rate, then independent lotteries match more students. If it has a decreasing hazard rate, the comparison reverses. To my knowledge, this is the first analytical result comparing the size of stable matchings under different priority rules. Finally, I study the fraction of assigned students who receive their first choice. Under independent lotteries, this fraction may be arbitrarily small, even if schools are equally popular. Under a single lottery, we provide a tight lower bound on this fraction which depends on the ratio r of the popularity of the most to least popular school. When each school has a single seat, the fraction of assigned students who receive their first choice is at least [Formula: see text]. This guarantee increases to [Formula: see text] as the number of seats at each school increases. This paper was accepted by Gabriel Weintraub, revenue management and market analytics.","PeriodicalId":18208,"journal":{"name":"Manag. Sci.","volume":"9 1","pages":"244-259"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Manag. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/mnsc.2022.4338","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

This paper studies outcomes of the deferred acceptance algorithm in large random matching markets where priorities are generated either by a single lottery or by independent lotteries. In contrast to prior work, my model permits students to submit lists of varying lengths and schools to vary in their popularity and number of seats. In a limiting regime where the number of students and schools grow while the length of student lists and number of seats at each school remain bounded, I provide exact expressions for the number of students who list l schools and match to one of their top k choices, for each [Formula: see text]. These expressions provide three main insights. First, there is a persistent tradeoff between using a single lottery and independent lotteries. For students who submit short lists, the rank distribution under a single lottery stochastically dominates the corresponding distribution under independent lotteries. However, the students who submit the longest lists are always more likely to match when schools use independent lotteries. Second, I compare the total number of matches in the two lottery systems, and find that the shape of the list length distribution plays a key role. If this distribution has an increasing hazard rate, then independent lotteries match more students. If it has a decreasing hazard rate, the comparison reverses. To my knowledge, this is the first analytical result comparing the size of stable matchings under different priority rules. Finally, I study the fraction of assigned students who receive their first choice. Under independent lotteries, this fraction may be arbitrarily small, even if schools are equally popular. Under a single lottery, we provide a tight lower bound on this fraction which depends on the ratio r of the popularity of the most to least popular school. When each school has a single seat, the fraction of assigned students who receive their first choice is at least [Formula: see text]. This guarantee increases to [Formula: see text] as the number of seats at each school increases. This paper was accepted by Gabriel Weintraub, revenue management and market analytics.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
择校彩票设计
本文研究了大型随机匹配市场中由单次抽签或独立抽签产生优先级的延迟接受算法的结果。与之前的工作相反,我的模型允许学生提交不同长度的列表,并允许学校在受欢迎程度和席位数量上有所不同。在学生和学校数量增长而学生名单的长度和每个学校的座位数量保持有限的限制制度下,我提供了列出l所学校并与他们的前k个选择之一相匹配的学生人数的精确表达式,对于每个[公式:见文本]。这些表达提供了三个主要见解。首先,在使用单一彩票和独立彩票之间存在持续的权衡。对于提交候选名单的学生,单次摇号下的排名分布随机优于独立摇号下的相应分布。然而,当学校使用独立抽签时,提交最长名单的学生总是更有可能匹配。其次,我比较了两种彩票系统中的匹配总数,发现列表长度分布的形状起着关键作用。如果这种分布的风险率越来越高,那么独立的彩票就会匹配更多的学生。如果它的危险率是递减的,那么对比就相反了。据我所知,这是第一个比较不同优先级规则下稳定匹配大小的分析结果。最后,我研究了得到第一选择的被分配学生的比例。在独立的彩票制度下,即使学校同样受欢迎,这个比例也可能任意小。在单一抽签的情况下,我们提供了这个分数的一个严格的下界,它取决于最受欢迎的学校与最不受欢迎的学校的受欢迎程度之比r。当每所学校只有一个席位时,获得第一选择的学生的比例至少为[公式:见文本]。随着每所学校的座位数量增加,这种保证增加到[公式:见文本]。本文被收益管理和市场分析专业的Gabriel Weintraub接受。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Disclosure in Incentivized Reviews: Does It Protect Consumers? Can Blockchain Technology Help Overcome Contractual Incompleteness? Evidence from State Laws Utility Tokens, Network Effects, and Pricing Power Decentralized Platforms: Governance, Tokenomics, and ICO Design The Conceptual Flaws of Decentralized Automated Market Making
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1