English
Related papers

Related papers: Stability in Repeated Matching Markets

200 papers

Since Choo and Siow (2006), a burgeoning literature has analyzed matching markets when utility is perfectly transferable and the joint surplus is separable. We take stock of recent methodological developments in this area. Combining…

Econometrics · Economics 2026-04-20 Pierre-Andre Chiappori , Dam Linh Nguyen , Bernard Salanie

While it has been well known in the ML community that deep learning models suffer from instability, the consequences for healthcare deployments are under characterised. We study the stability of different model architectures trained on…

Consider the standard hospitals/residents problem, or the two-sided many-to-one stable matching problem, and assume that the true preference lists of both sides are complete and strict. The lists actually submitted, however, are truncated.…

Computer Science and Game Theory · Computer Science 2016-12-08 Hisao Tamaki

Matching games is a novel matching model introduced by Garrido-Lucero and Laraki, in which agents' utilities are endogenously determined as the outcome of a strategic game they play simultaneously with the matching process. Matching games…

Computer Science and Game Theory · Computer Science 2025-07-23 Felipe Garrido-Lucero , Rida Laraki

In bipartite matching problems, agents on two sides of a graph want to be paired according to their preferences. The stability of a matching depends on these preferences, which in uncertain environments also reflect agents' beliefs about…

Computer Science and Game Theory · Computer Science 2025-11-10 Jonathan Shaki , Jiarui Gan , Sarit Kraus

With the growing collection of sales and marketing data and depth of detailed knowledge of consumer habits and trends, firms are gaining the capability to discern customers of other firms from the potential market of uncommitted consumers.…

Optimization and Control · Mathematics 2015-10-28 Chloe A. Fletcher , Jason S. Howell

We show how fragile stable matchings are in a decentralized one-to-one matching setting. The classical work of Roth and Vande Vate (1990) suggests simple decentralized dynamics in which randomly-chosen blocking pairs match successively.…

Theoretical Economics · Economics 2024-03-20 Kirill Rudov

We study a one-to-one labor matching market. If a worker considers resigning from her current job to obtain a better one, how long does it take for this worker to actually get it? We present an algorithm that models this situation as a…

Theoretical Economics · Economics 2024-05-14 Agustin G. Bonifacio , Nadia Guiñazu , Noelia Juarez , Pablo Neme , Jorge Oviedo

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

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

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

The Stable Marriage Problem is to find a one-to-one matching for two equally sized sets of agents. Due to its widespread applications in the real world, especially the unique importance to the centralized match maker, a very large number of…

Physics and Society · Physics 2018-06-26 Gui-Yuan Shi , Yi-Xiu Kong , Bo-Lun Chen , Guang-Hui Yuan , Rui-Jie Wu

A well known result states that stability criterion for matchings in two-sided markets doesn't ensure uniqueness. This opens the door for a moral question with regard to the optimal stable matching from a social point of view. Here, a new…

Computer Science and Game Theory · Computer Science 2016-12-30 Royi Jacobovic

Two-sided matching platforms provide users with menus of match recommendations. To maximize the number of realized matches between the two sides (referred here as customers and suppliers), the platform must balance the inherent tension…

Computer Science and Game Theory · Computer Science 2020-07-29 Itai Ashlagi , Anilesh K. Krishnaswamy , Rahul Makhijani , Daniela Saban , Kirankumar Shiragur

We study stable matching problems with locality of information and control. In our model, each agent is a node in a fixed network and strives to be matched to another agent. An agent has a complete preference list over all other agents it…

Data Structures and Algorithms · Computer Science 2016-11-22 Martin Hoefer , Lisa Wagner

The Hospitals / Residents problem with Couples (HRC) is a generalisation of the classical Hospitals / Resident problem (HR) that is important in practical applications because it models the case where couples submit joint preference lists…

Data Structures and Algorithms · Computer Science 2014-05-29 P. Biro , D. F. Manlove , I. McBride

Adaptivity to changing environments and constraints is key to success in modern society. We address this by proposing "incrementalized versions" of Stable Marriage and Stable Roommates. That is, we try to answer the following question: for…

Computer Science and Game Theory · Computer Science 2019-11-25 Robert Bredereck , Jiehua Chen , Dušan Knop , Junjie Luo , Rolf Niedermeier

The propagation of infectious diseases and its impact on individuals play a major role in disease dynamics, and it is important to incorporate population heterogeneity into efforts to study diseases. As a simplistic but illustrative…

Populations and Evolution · Quantitative Biology 2019-07-24 Juan G. Calvo , Alberto Hernández , Mason A. Porter , Fabio Sanchez

Using school choice as a motivating example, we introduce a stylized model of a many-to-one matching market where the clearinghouse aims to implement contingent priorities, i.e., priorities that depend on the current assignment, to…

Computer Science and Game Theory · Computer Science 2024-09-10 Ignacio Rios , Federico Bobbio , Margarida Carvalho , Alfredo Torrico

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
‹ Prev 1 4 5 6 7 8 10 Next ›