English
Related papers

Related papers: The Competition for Partners in Matching Markets

200 papers

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

We study the problem of online learning in competitive settings in the context of two-sided matching markets. In particular, one side of the market, the agents, must learn about their preferences over the other side, the firms, through…

Artificial Intelligence · Computer Science 2022-06-07 Chinmay Maheshwari , Eric Mazumdar , Shankar Sastry

We consider two sided matching markets consisting of agents with non-transferable utilities; agents from the opposite sides form matching pairs (e.g., buyers-sellers) and negotiate the terms of their math which may include a monetary…

Computer Science and Game Theory · Computer Science 2012-12-05 Saeed Alaei , Kamal Jain , Azarakhsh Malekian

Matching algorithms have demonstrated great success in several practical applications, but they often require centralized coordination and plentiful information. In many modern online marketplaces, agents must independently seek out and…

Computer Science and Game Theory · Computer Science 2025-01-14 Vade Shah , Bryce L. Ferguson , Jason R. Marden

Properties of stable matchings in the popular random-matching-market model have been studied for over 50 years. In a random matching market, each agent has complete preferences drawn uniformly and independently at random. Wilson (1972),…

Computer Science and Game Theory · Computer Science 2024-02-16 Aditya Potukuchi , Shikha Singh

Two-sided matching markets, environments in which two disjoint groups of agents seek to partner with one another, arise in several contexts. In static, centralized markets where agents know their preferences, standard algorithms can yield a…

Computer Science and Game Theory · Computer Science 2025-04-08 Vade Shah , Bryce L. Ferguson , Jason R. Marden

In a dynamic matching market, such as a marriage or job market, how should agents balance accepting a proposed match with the cost of continuing their search? We consider this problem in a discrete setting, in which agents have cardinal…

Computer Science and Game Theory · Computer Science 2021-06-16 Ishan Agarwal , Richard Cole , Yixin Tao

We study the two-sided stable matching problem with one-sided uncertainty for two sets of agents A and B, with equal cardinality. Initially, the preference lists of the agents in A are given but the preferences of the agents in B are…

Data Structures and Algorithms · Computer Science 2024-07-16 Evripidis Bampis , Konstantinos Dogeas , Thomas Erlebach , Nicole Megow , Jens Schlöter , Amitabh Trehan

Two-sided matching markets describe a large class of problems wherein participants from one side of the market must be matched to those from the other side according to their preferences. In many real-world applications (e.g. content…

Computer Science and Game Theory · Computer Science 2024-10-16 Hadi Hosseini , Sanjukta Roy , Duohan Zhang

We study dynamic matching in an infinite-horizon stochastic market. While all agents are potentially compatible with each other, some are hard-to-match and others are easy-to-match. Agents prefer to be matched as soon as possible and…

Data Structures and Algorithms · Computer Science 2017-11-09 Itai Ashlagi , Maximillien Burq , Patrick Jaillet , Vahideh Manshadi

An approximation of strategyproofness in large, two-sided matching markets is highly evident. Through simulations, one can observe that the percentage of agents with useful deviations decreases as the market size grows. Furthermore, there…

Multiagent Systems · Computer Science 2022-11-30 Lars Lien Ankile , Kjartan Krange , Yuto Yagi

We study the stable marriage problem in two-sided markets with randomly generated preferences. We consider agents on each side divided into a constant number of "soft tiers", which intuitively indicate the quality of the agent.…

Computer Science and Game Theory · Computer Science 2021-01-14 Itai Ashlagi , Mark Braverman , Amin Saberi , Clayton Thomas , Geng Zhao

We introduce a simple benchmark model of dynamic matching in networked markets, where agents arrive and depart stochastically and the network of acceptable transactions among agents forms a random graph. We analyze our model from three…

Computer Science and Game Theory · Computer Science 2014-02-18 Mohammad Akbarpour , Shengwu Li , Shayan Oveis Gharan

We study two-sided many-to-one matching markets with transferable utilities, e.g., labor and rental housing markets, in which money can exchange hands between agents, subject to distributional constraints on the set of feasible allocations.…

Theoretical Economics · Economics 2022-04-26 Devansh Jalota , Michael Ostrovsky , Marco Pavone

We study the problem of pure exploration in matching markets under uncertain preferences, where the goal is to identify a stable matching with confidence parameter $\delta$ and minimal sample complexity. Agents learn preferences via…

Computer Science and Game Theory · Computer Science 2025-09-19 Tejas Pagare , Agniv Bandyopadhyay , Sandeep Juneja

Cross-group externalities and network effects in two-sided platform markets shape market structure and competition policy, and are the subject of extensive study. Less understood are the within-group externalities that arise when the…

Theoretical Economics · Economics 2020-11-10 Quitzé Valenzuela-Stookey

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

Although both data availability and the demand for accurate forecasts are increasing, collaboration between stakeholders is often constrained by data ownership and competitive interests. In contrast to recent proposals within cooperative…

Machine Learning · Computer Science 2026-05-14 Michael Vitali , Pierre Pinson

A breakthrough of Ashlagi, Kanoria, and Leshno [AKL17] found that imbalance in the number of agents on either side of a random matching market has a profound effect on the market's expected characteristics. Specifically, across all stable…

Computer Science and Game Theory · Computer Science 2021-03-12 Linda Cai , Clayton Thomas

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
‹ Prev 1 2 3 10 Next ›