Redesigning the Israeli medical internship match

Slava Bronfman; Noga Alon; Avinatan Hassidim; Assaf Romm

doi:10.1145/3274646

Redesigning the Israeli medical internship match

Slava Bronfman, Noga Alon, Avinatan Hassidim, Assaf Romm

School of Computer Science

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

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.

Original language	English
Pages (from-to)	1-18
Number of pages	18
Journal	ACM Transactions on Economics and Computation
Volume	6
Issue number	3-4
DOIs	https://doi.org/10.1145/3274646
State	Published - Sep 2018

Funding

Funders	Funder number
Falk Institute	1780/16
United States - Israel Binational Agricultural Research and Development Fund
Resnick Sustainability Institute for Science, Energy and Sustainability, California Institute of Technology
German-Israeli Foundation for Scientific Research and Development
United States-Israel Binational Science Foundation
Israel Science Foundation
National Science Foundation	1394/16

Keywords

Assignment problem
Market design
Matching with couples

Access to Document

10.1145/3274646

Cite this

@article{f4e58996cccb44b4898113b81636479e,

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 = "Publisher Copyright: {\textcopyright} 2018 Association for Computing Machinery.",

year = "2018",

month = sep,

doi = "10.1145/3274646",

language = "אנגלית",

volume = "6",

pages = "1--18",

journal = "ACM Transactions on Economics and Computation",

issn = "2167-8375",

publisher = "Association for Computing Machinery (ACM)",

number = "3-4",

}

TY - JOUR

T1 - Redesigning the Israeli medical internship match

AU - Bronfman, Slava

AU - Alon, Noga

AU - Hassidim, Avinatan

AU - Romm, Assaf

PY - 2018/9

Y1 - 2018/9

N2 - 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.

AB - 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.

KW - Assignment problem

KW - Market design

KW - Matching with couples

UR - http://www.scopus.com/inward/record.url?scp=85054270380&partnerID=8YFLogxK

U2 - 10.1145/3274646

DO - 10.1145/3274646

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85054270380

SN - 2167-8375

VL - 6

SP - 1

EP - 18

JO - ACM Transactions on Economics and Computation

JF - ACM Transactions on Economics and Computation

IS - 3-4

ER -

Redesigning the Israeli medical internship match

Abstract

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this