|
|
|
|
| LEADER |
01796nam a2200313Ia 4500 |
| 001 |
10.1145-3274646 |
| 008 |
220706s2018 CNT 000 0 und d |
| 020 |
|
|
|a 21678375 (ISSN)
|
| 245 |
1 |
0 |
|a Redesigning the Israeli medical internship match
|
| 260 |
|
0 |
|b Association for Computing Machinery
|c 2018
|
| 856 |
|
|
|z View Fulltext in Publisher
|u https://doi.org/10.1145/3274646
|
| 520 |
3 |
|
|a 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. © 2018 Association for Computing Machinery.
|
| 650 |
0 |
4 |
|a Assignment problem
|
| 650 |
0 |
4 |
|a Assignment problems
|
| 650 |
0 |
4 |
|a Combinatorial optimization
|
| 650 |
0 |
4 |
|a Commerce
|
| 650 |
0 |
4 |
|a Market design
|
| 650 |
0 |
4 |
|a Matching with couples
|
| 650 |
0 |
4 |
|a New mechanisms
|
| 650 |
0 |
4 |
|a Polynomial approximation
|
| 650 |
0 |
4 |
|a Polynomial-time algorithms
|
| 650 |
0 |
4 |
|a Real-world
|
| 650 |
0 |
4 |
|a Stochastic systems
|
| 650 |
0 |
4 |
|a Two-body problem
|
| 700 |
1 |
|
|a Alon, N.
|e author
|
| 700 |
1 |
|
|a Bronfman, S.
|e author
|
| 700 |
1 |
|
|a Hassidim, A.
|e author
|
| 700 |
1 |
|
|a Romm, A.
|e author
|
| 773 |
|
|
|t ACM Transactions on Economics and Computation
|
