License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ITCS.2021.74
URN: urn:nbn:de:0030-drops-136139
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/13613/
Beyhaghi, Hedyeh ;
Tardos, Éva
Randomness and Fairness in Two-Sided Matching with Limited Interviews
Abstract
We study the outcome in a matching market where both sides have limited ability to consider options. For example, in the national residency matching program, doctors are limited to apply to a small set of hospitals, and hospitals are limited by the time required to interview candidates.
Our main findings are the following: (1) In markets where jobs can only consider a limited number of candidates for interview, it increases the size of the resulting matching if the system has a limit on the number of applications a candidate can send. (2) The fair system of all applicants being allowed to apply to the exact same number of positions maximizes the expected size of the matching. More particularly, starting from an integer k as the number of applications, the matching size decreases as a few applicants are allowed to apply to one additional position (and then increases again as they are all allowed to apply to k+1). Although it seems natural to expect that the size of the matching would be a monotone increasing and concave function in the number of applications, our results show that neither is true. These results hold even in a market where a-priori all jobs and all candidates are equally likely to be good, and the judgments of different employers and candidates are independent.
Our main technical contribution is computing the expected size of the matching found via the deferred acceptance algorithm as a function of the number of interviews and applications in a market where preferences are uniform and independent. Through simulations we confirm that these findings extend to markets where rankings become correlated after the interviews.
BibTeX - Entry
@InProceedings{beyhaghi_et_al:LIPIcs.ITCS.2021.74,
author = {Hedyeh Beyhaghi and \'{E}va Tardos},
title = {{Randomness and Fairness in Two-Sided Matching with Limited Interviews}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {74:1--74:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {James R. Lee},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13613},
URN = {urn:nbn:de:0030-drops-136139},
doi = {10.4230/LIPIcs.ITCS.2021.74},
annote = {Keywords: Matching with Short Lists, Stable Matching, Balls in Bins Problem}
}
|
Keywords: |
|
Matching with Short Lists, Stable Matching, Balls in Bins Problem |
|
Collection: |
|
12th Innovations in Theoretical Computer Science Conference (ITCS 2021) |
|
Issue Date: |
|
2021 |
|
Date of publication: |
|
04.02.2021 |
