English
Related papers

Related papers: Interviewing Matching in Random Markets

200 papers

In many two-sided labor markets, interviews are conducted before matches are formed. The growing number of interviews in medical residency markets has increased demand for signaling mechanisms, where applicants send a limited number of…

Computer Science and Game Theory · Computer Science 2025-10-09 Maxwell Allman , Itai Ashlagi , Amin Saberi , Sophie H. Yu

The academic job market for new statisticians is highly congested at the interview stage, where departments must rank and select candidates from large applicant pools without credible signals of candidate interest. As a result, interviews…

Applications · Statistics 2026-04-17 Ali Kaazempur-Mofrad , Xiaowu Dai , Xuming He

In several two-sided markets, including labor and dating, agents typically have limited information about their preferences prior to mutual interactions. This issue can result in matching frictions, as arising in the labor market for…

Data Structures and Algorithms · Computer Science 2025-01-23 Itai Ashlagi , Jiale Chen , Mohammad Roghani , Amin Saberi

The stable marriage problem and its extensions have been extensively studied, with much of the work in the literature assuming that agents fully know their own preferences over alternatives. This assumption however is not always practical…

Computer Science and Game Theory · Computer Science 2016-03-21 Baharak Rastegari , Paul Goldberg , David Manlove

Most doctors in the NRMP are matched to one of their most-preferred internship programs. Since various surveys indicate similarities across doctors' preferences, this suggests a puzzle. How can nearly everyone get a position in a…

General Economics · Economics 2020-12-10 Federico Echenique , Ruy Gonzalez , Alistair Wilson , Leeat Yariv

Based on the success of recommender systems in e-commerce, there is growing interest in their use in matching markets (e.g., labor). While this holds potential for improving market fluidity and fairness, we show in this paper that naively…

Information Retrieval · Computer Science 2021-06-04 Yi Su , Magd Bayoumi , Thorsten Joachims

The rise of Large Language Models (LLMs) has driven progress in reasoning tasks -- from program synthesis to scientific hypothesis generation -- yet their ability to handle ranked preferences and structured algorithms in combinatorial…

Artificial Intelligence · Computer Science 2025-12-09 Hadi Hosseini , Samarth Khanna , Ronak Singh

We explore the possibility of designing matching mechanisms that can accommodate non-standard choice behavior. We pin down the necessary and sufficient conditions on participants' choice behavior for the existence of stable and incentive…

Theoretical Economics · Economics 2024-08-12 Gian Caspari , Manshu Khanna

The study of stable matchings usually relies on the assumption that agents' preferences over the opposite side are complete and known. In many real markets, however, preferences might be uncertain and revealed only through costly…

Computer Science and Game Theory · Computer Science 2026-02-25 Moshe Babaioff , Rotem Gil , Assaf Romm

In many matching markets, one side "applies" to the other, and these applications are often expensive and time-consuming (e.g. students applying to college). It is tempting to think that making the application process easier should benefit…

Computer Science and Game Theory · Computer Science 2016-12-30 S. Matthew Weinberg , James Zou

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…

Computer Science and Game Theory · Computer Science 2025-06-25 Richard Cole , Pranav Jangir

We study the competition for partners in two-sided matching markets with heterogeneous agent preferences, with a focus on how the equilibrium outcomes depend on the connectivity in the market. We model random partially connected markets,…

Computer Science and Game Theory · Computer Science 2023-01-12 Yash Kanoria , Seungki Min , Pengyu Qian

Two-sided matching markets have long existed to pair agents in the absence of regulated exchanges. A common example is school choice, where a matching mechanism uses student and school preferences to assign students to schools. In such…

Machine Learning · Computer Science 2021-09-17 Stefania Ionescu , Yuhao Du , Kenneth Joseph , Anikó Hannák

Two-sided matching platforms rely on preferences from both sides, yet participants can evaluate only a small fraction of potential partners. In practice, they use low-cost pre-match screening, e.g., interviews, profile views, or trial…

Computer Science and Game Theory · Computer Science 2026-05-26 Amirmahdi Mirfakhar , Xuchuang Wang , Mengfan Xu , Hedyeh Beyhaghi , Mohammad Hajiesmaili

Automatic matching of job offers and job candidates is a major problem for a number of organizations and job applicants that if it were successfully addressed could have a positive impact in many countries around the world. In this context,…

Other Computer Science · Computer Science 2023-05-08 Jorge Martinez-Gil , Alejandra Lorena Paoletti , Mario Pichler

We consider two-sided matching markets, and study the incentives of agents to circumvent a centralized clearing house by signing binding contracts with one another. It is well-known that if the clearing house implements a stable match and…

Computer Science and Game Theory · Computer Science 2015-04-14 Nick Arnosti , Nicole Immorlica , Brendan Lucier

Many two-sided matching markets, from labor markets to school choice programs, use a clearinghouse based on the applicant-proposing deferred acceptance algorithm, which is well known to be strategy-proof for the applicants. Nonetheless, a…

Computer Science and Game Theory · Computer Science 2018-07-19 Itai Ashlagi , Yannai A. Gonczarowski

Many-to-one matching markets exist in numerous different forms, such as college admissions, matching medical interns to hospitals for residencies, assigning housing to college students, and the classic firms and workers market. In all these…

Social and Information Networks · Computer Science 2011-07-25 Elizabeth Bodine-Baron , Christina Lee , Anthony Chong , Babak Hassibi , Adam Wierman

The matching literature often recommends market centralization under the assumption that agents know their own preferences and that their preferences are fixed. We find counterevidence to this assumption in a quasi-experiment. In Germany's…

General Economics · Economics 2022-06-07 Julien Grenet , YingHua He , Dorothea Kübler

In many two-sided markets, the parties to be matched have incomplete information about their characteristics. We consider the settings where the parties engaged are extremely patient and are interested in long-term partnerships. Hence, once…

Computer Science and Game Theory · Computer Science 2019-08-30 Kartik Ahuja , Mihaela van der Schaar
‹ Prev 1 2 3 10 Next ›