@article{956f45c8fb3c448fa687c25e72f5a5e8,
title = "Redesigning the Israeli medical internship match",
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.",
keywords = "Assignment problem, Market design, Matching with couples",
author = "Slava Bronfman and Noga Alon and Avinatan Hassidim and Assaf Romm",
note = "Funding Information: This research was supported in part by a grant from the United States - Israel Binational Science Foundation (BSF), Jerusalem, Israel, by an ISF grant and by a GIF grant. Hassidim is supported by ISF grant 1394/16. Romm is supported by a Falk Institute grant and by ISF grant 1780/16. Part of the research was done while Alon and Romm were co-affiliated with Microsoft Research. Authors{\textquoteright} addresses: S. Bronfman, Computer Sciences, Bar-Ilan University, Ramat-Gan, 52900, Israel; email: slavabro@ gmail.com; N. Alon, Tel-Aviv University, Tel-Aviv, 69978, Israel, Princeton University, Princeton, NJ, 08544; email: nogaa@ tau.ac.il; A. Hassidim, Computer Sciences, Bar-Ilan University, Ramat-Gan, 52900, Israel; email: avinatan@macs.biu.ac.il; A. Romm, Hebrew University of Jerusalem, Jerusalem, 91905, Israel; email: assaf.romm@mail.huji.ac.il. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. {\textcopyright} 2018 Association for Computing Machinery. 2167-8375/2018/09-ART21 $15.00 https://doi.org/10.1145/3274646 Funding Information: This research was supported in part by a grant from the United States - Israel Binational Science Foundation (BSF), Jerusalem, Israel, by an ISF grant and by a GIF grant. Hassidim is supported by ISF grant 1394/16. Romm is supported by a Falk Institute grant and by ISF grant 1780/16. Part of the research was done while Alon and Romm were co-affiliated with Microsoft Research. Publisher Copyright: {\textcopyright} 2018 Association for Computing Machinery.",
year = "2018",
month = sep,
doi = "10.1145/3274646",
language = "English (US)",
volume = "6",
pages = "1--18",
journal = "ACM Transactions on Economics and Computation",
issn = "2167-8375",
publisher = "Association for Computing Machinery (ACM)",
number = "3-4",
}