Distributed Interview Selection for Stable Matching in Large Random Markets
Richard Cole, Pranav Jangir

TL;DR
This paper proposes a distributed, low-communication interview strategy for candidates in large stable matching markets, achieving exponentially low non-match rates and near-stable equilibria, with theoretical bounds supported by experiments.
Contribution
It introduces a novel distributed approach for interview selection in large markets, providing theoretical bounds and equilibrium analysis that improve understanding of matching efficiency.
Findings
Non-match rates decrease exponentially with interviews
Larger capacities improve hospital and school outcomes
An $psilon$-Nash equilibrium exists for students except the bottommost
Abstract
In real-world settings of the Deferred Acceptance stable matching algorithm, such as the American medical residency match (NRMP), school choice programs, and various national university entrance systems, candidates need to decide which programs to list. In many of these settings there is an initial phase of interviews or information gathering which affect the preferences on one or both sides. We ask: which interviews should candidates seek? We study this question in a model, introduced by Lee (2016) and modified by Allman and Ashlagi (2023), with preferences based on correlated cardinal utilities. We describe a distributed, low-communication strategy for the doctors and students, which lead to non-match rates of in the residency setting and in the school-choice setting, where is the number of interviews per doctor in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Survey Methodology and Nonresponse · Sports Analytics and Performance
