English
Related papers

Related papers: The Losses from Integration in Matching Markets ca…

200 papers

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 integration monotonicity,…

Economics · Quantitative Finance 2018-09-17 Josue Ortega

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

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 the welfare consequences of merging Shapley--Scarf markets. Market integration can lead to large welfare losses and make the vast majority of agents worse-off, but is on average welfare-enhancing and makes all agents better off…

Theoretical Economics · Economics 2022-01-10 Rajnish Kunar , Kriti Manocha , Josue Ortega

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 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

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

We consider a learning problem for the stable marriage model under unknown preferences for the left side of the market. We focus on the centralized case, where at each time step, an online platform matches the agents, and obtains a noisy…

Machine Learning · Computer Science 2025-01-07 Andreas Athanasopoulos , Anne-Marie George , Christos Dimitrakakis

In two-sided matching markets, the agents are partitioned into two sets. Each agent wishes to be matched to an agent in the other set and has a strict preference over these potential matches. A matching is stable if there are no blocking…

Computer Science and Game Theory · Computer Science 2013-02-26 Georgios Askalidis , Nicole Immorlica , Emmanouil Pountourakis

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 the Gale-Shapley model of two-sided matching, it is well known that for generic preferences, the outcomes for each side can vary dramatically in the male-optimal vs. female-optimal stable matchings. In this paper, we show that under a…

Theoretical Economics · Economics 2026-03-26 Bill Wang

Two-sided matchings are an important theoretical tool used to model markets and social interactions. In many real life problems the utility of an agent is influenced not only by their own choices, but also by the choices that other agents…

Computer Science and Game Theory · Computer Science 2012-07-17 Simina Brânzei , Tomasz P. Michalak , Talal Rahwan , Kate Larson , Nicholas R. Jennings

In this work, we analyze the influence of a single strategic agent on the quality of the other agents' matchings in a matching market. We consider a stable matching problem with $n$ men and $n$ women when preferences are drawn uniformly…

Computer Science and Game Theory · Computer Science 2020-10-12 Ron Kupfer

It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a general class of large random markets the algorithm will find a…

Computer Science and Game Theory · Computer Science 2015-03-17 Itai Ashlagi , Mark Braverman , Avinatan Hassidim

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

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 consider the two-sided stable matching setting in which there may be uncertainty about the agents' preferences due to limited information or communication. We consider three models of uncertainty: (1) lottery model --- in which for each…

Computer Science and Game Theory · Computer Science 2016-07-12 Haris Aziz , Péter Biró , Serge Gaspers , Ronald de Haan , Nicholas Mattei , Baharak Rastegari

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

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

This paper studies matching markets where institutions are matched with possibly more than one individual. The matching market contains some couples who view the pair of jobs as complements. First, we show by means of an example that a…

Theoretical Economics · Economics 2025-07-11 Shashwat Khare , Souvik Roy , Ton Storcken
‹ Prev 1 2 3 10 Next ›