Interviewing Matching in Random Markets
In many centralized labor markets candidates interview with potential employers before matches are formed through a clearinghouse One prominent example is the market for medical residencies and fellowships, which in recent years has had a large increase in the number of interviews. There have been numerous efforts to reduce the cost of interviewing in these markets using a variety of signalling mechanisms, however, the theoretical properties of these mechanisms have not been systematically studied in models with rich preferences. In this paper we give theoretical guarantees for a variety of mechanisms, finding that these mechanisms must properly balance competition. We consider a random market in which agents' latent preferences are based on observed qualities, personal taste and (ex post) interview shocks and assume that following an interview mechanism a final stable match is generated with respect to preferences over interview partners. We study a novel many-to-many interview match mechanism to coordinate interviews and that with relatively few interviews, when suitably designed, the interview match yields desirable properties. We find that under the interview matching mechanism with a limit of $k$ interviews per candidate and per position, the fraction of positions that are unfilled vanishes quickly with $k$. Moreover the ex post efficiency grows rapidly with $k$, and reporting sincere pre-interview preferences to this mechanism is an $\epsilon$-Bayes Nash equilibrium. Finally, we compare the performance of the interview match to other signalling and coordination mechanisms from the literature.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Social Integration in Two-Sided Matching Markets
When several two-sided matching markets merge into one, it is inevitable that some agents will become worse off if the matching mechanism used is stable. I formalize this observation by defining the property of integrati…
Vocal Bursts Valence PredictionThe Complexity of Interactively Learning a Stable Matching by Trial and Error
In a stable matching setting, we consider a query model that allows for an interactive learning algorithm to make precisely one type of query: proposing a matching, the response to which is either that the proposed match…
BlockingWisdom and Foolishness of Noisy Matching Markets
We consider a many-to-one matching market where colleges share true preferences over students but make decisions using only independent noisy rankings. Each student has a true value $v$, but each college $c$ ranks the st…
Matching markets with farsighted couples
We adopt the notion of the farsighted stable set to determine which matchings are stable when agents are farsighted in matching markets with couples. We show that a singleton matching is a farsighted stable set if and on…
Game Theoretic Consequences of Resident Matching
The resident matching algorithm, Gale-Shapley, currently used by SF Match and the National Residency Match Program (NRMP), has been in use for over 50 years without fundamental alteration. The algorithm is a 'stable-marr…