以色列医学实习竞赛中的二体指派问题
Two-Body Assignment Problem in the Context of the Israeli Medical Internship Match
摘要:
本论文是根据巴伊兰大学计算机科学系硕士学位的部分要求提交的。获得以色列医学博士学位的最后一步正在以色列的一家医院实习一年。实习是通过抽签决定的,这被称为“实习抽签”。2014年,我们重新设计了彩票,用更高效的彩票取而代之。新方法基于计算暂定彩票,其中每个学生都有一定的概率到达每家医院。然后,一个计算机程序在学生之间进行“交易”,只有在对双方都有利的情况下才进行交易。这种贸易创造了盈余,这意味着更多的学生得到了他们的首选之一。学生平均提高了他的位置$0.91$席位。新的方法可以提高医学毕业生的福利,让他们有更多的机会获得他们的首选之一。它也可以应用于其他国家的实习市场。本文介绍了市场,重新设计的过程和新的机制,这是现在使用。我们从这个市场学到了两个主要教训。第一个原则是“不造成伤害”原则,即(几乎)所有参与者都应该喜欢新机制而不是旧机制。第二,在处理物体分配中的两体问题时,需要使用新的方法。我们集中在第二课,并在指派问题的背景下研究两体问题。我们证明了在存在耦合的情况下,将随机分配矩阵分解为确定性分配是NP-难的,并给出了一个具有最优最坏情况保证的多项式时间算法。我们还研究了我们的算法在真实世界和模拟数据上的性能。
英文摘要:
This thesis was submitted as partial fulfillment of the requirements for the Masters Degree in the Department of Computer Science, Bar-Ilan University. The final step in getting an Israeli M.D. 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. The new method is based on calculating a tentative lottery, in which each student has some probability of getting to each hospital. Then a computer program "trades" between the students, where trade is performed only if it is beneficial to both sides. This trade creates surplus, which translates to more students getting one of their top choices. The average student improved his place by $0.91$ seats. The new method can improve the welfare of medical graduates, by giving them more probability to get to one of their top choices. It can be applied in internship markets in other countries as well. This thesis presents the market, the redesign process and the new mechanism which is now in use. There are two main lessons that we have learned from this market. The first is the "Do No Harm" principle, which states that (almost) all participants should prefer the new mechanism to the old one. The second is that new approaches need to be used when dealing with two-body problems in object assignment. We focus on the second lesson, and study two-body problems in the context of the assignment problem. 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 on simulated data.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。