重新设计以色列医疗实习比赛

Slava Bronfman
{"title":"重新设计以色列医疗实习比赛","authors":"Slava Bronfman","doi":"10.2139/ssrn.2603546","DOIUrl":null,"url":null,"abstract":"The final step in getting an Israeli MD is performing a year-long internship in one of the hospitals in Israel. Internships are decided upon by a lottery, which is known as the Internship Lottery. In 2014, we redesigned the lottery, replacing it with a more efficient one. This article presents the market, the redesign process, and the new mechanism that is now in use. In this article, we describe the redesign and focus on two-body problems that we faced in the new mechanism. Specifically, we show that decomposing stochastic assignment matrices to deterministic allocations is NP-hard in the presence of couples, and present a polynomial-time algorithm with the optimal worst case guarantee. We also study the performance of our algorithm on real-world and simulated data.","PeriodicalId":376992,"journal":{"name":"Proceedings of the Sixteenth ACM Conference on Economics and Computation","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Redesigning the Israeli Medical Internship Match\",\"authors\":\"Slava Bronfman\",\"doi\":\"10.2139/ssrn.2603546\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The final step in getting an Israeli MD is performing a year-long internship in one of the hospitals in Israel. Internships are decided upon by a lottery, which is known as the Internship Lottery. In 2014, we redesigned the lottery, replacing it with a more efficient one. This article presents the market, the redesign process, and the new mechanism that is now in use. In this article, we describe the redesign and focus on two-body problems that we faced in the new mechanism. Specifically, we show that decomposing stochastic assignment matrices to deterministic allocations is NP-hard in the presence of couples, and present a polynomial-time algorithm with the optimal worst case guarantee. We also study the performance of our algorithm on real-world and simulated data.\",\"PeriodicalId\":376992,\"journal\":{\"name\":\"Proceedings of the Sixteenth ACM Conference on Economics and Computation\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Sixteenth ACM Conference on Economics and Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/ssrn.2603546\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Sixteenth ACM Conference on Economics and Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.2603546","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

摘要

获得以色列医学博士的最后一步是在以色列的一家医院进行为期一年的实习。实习是通过抽签决定的,这被称为实习抽签。2014年,我们重新设计了彩票,用一个更高效的彩票取代了它。本文介绍了市场、重新设计过程以及目前正在使用的新机制。在本文中,我们描述了重新设计,并重点讨论了我们在新机制中面临的两体问题。具体地说,我们证明了随机分配矩阵分解为确定性分配在存在偶的情况下是np困难的,并提出了一个具有最优最差情况保证的多项式时间算法。我们还研究了我们的算法在真实世界和模拟数据上的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Redesigning the Israeli Medical Internship Match
The final step in getting an Israeli MD is performing a year-long internship in one of the hospitals in Israel. Internships are decided upon by a lottery, which is known as the Internship Lottery. In 2014, we redesigned the lottery, replacing it with a more efficient one. This article presents the market, the redesign process, and the new mechanism that is now in use. In this article, we describe the redesign and focus on two-body problems that we faced in the new mechanism. Specifically, we show that decomposing stochastic assignment matrices to deterministic allocations is NP-hard in the presence of couples, and present a polynomial-time algorithm with the optimal worst case guarantee. We also study the performance of our algorithm on real-world and simulated data.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信