English
Related papers

Related papers: Unidirectional substitutes and complements

200 papers

We provide a framework to study stability notions for two-sided dynamic matching markets in which matching is one-to-one and irreversible. The framework gives center stage to the set of matchings an agent anticipates would ensue should they…

Theoretical Economics · Economics 2024-10-17 Laura Doval , Pablo Schenone

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

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

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

Stable matching in a community consisting of men and women is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale and Shapley, who…

Data Structures and Algorithms · Computer Science 2021-12-14 Hugo Gimbert , Claire Mathieu , Simon Mauras

Consider a one-to-one two-sided matching market with workers on one side and single-position firms on the other, and suppose that the largest individually rational matching contains $n$ pairs. We show that the number of workers employed and…

Theoretical Economics · Economics 2025-06-02 Gregory Z. Gutin , Philip R. Neary , Anders Yeo

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

We study the set of incentive compatible and efficient two-sided matching mechanisms. We classify all such mechanisms under an additional assumption -- "gender-neutrality" -- which guarantees that the two sides be treated symmetrically. All…

Theoretical Economics · Economics 2023-01-31 Sophie Bade , Joseph Root

We revisit the problem of existence of stable systems of contracts with arbitrary sets of contracts. We show that stable sets of contracts exists if choices of agents satisfy path-independence. We call such choice functions Plott functions.…

Combinatorics · Mathematics 2021-08-17 Vladimir I. Danilov , Gleb A. Koshevoy

This paper presents weakened notions of corewise stability and setwise stability for matching markets where agents have substitutable choice functions. We introduce the concepts of worker-quasi-core, firm-quasi-core, and worker-quasisetwise…

Theoretical Economics · Economics 2024-11-20 Nadia Guiñazú , Noelia Juarez , Pablo Neme , Jorge Oviedo

We study a matching problem between agents and public goods, in settings without monetary transfers. Since goods are public, they have no capacity constraints. There is no exogenously defined budget of goods to be provided. Rather, each…

Computer Science and Game Theory · Computer Science 2025-06-10 Sara Fish , Yannai A. Gonczarowski , Sergiu Hart

We consider a distributed system with identical agents, constant-spacing policy and asymmetric bidirectional control, where the asymmetry is due to different controllers, which we describe by transfer functions. By applying the wave…

Systems and Control · Computer Science 2016-11-17 Dan Martinec , Ivo Herman , Michael Šebek

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

We show, that a simple generalization of the Deferred Acceptance Procedure with firms proposing due to Gale and Shapley(1962), yeild outcomes for a two-sided contract choice problem, which necessarily belong to the core and are Weakly…

Computer Science and Game Theory · Computer Science 2007-05-23 Somdeb Lahiri

This paper studies matching markets in the presence of middlemen. In our framework, a buyer-seller pair may either trade directly or use the services of a middleman; and a middleman may serve multiple buyer-seller pairs. Direct trade…

Theoretical Economics · Economics 2022-01-25 Ata Atay , Eric Bahel , Tamás Solymosi

Dynamic pricing schemes were introduced as an alternative to posted-price mechanisms. In contrast to static models, the dynamic setting allows to update the prices between buyer-arrivals based on the remaining sets of items and buyers, and…

Computer Science and Game Theory · Computer Science 2022-04-27 Kristóf Bérczi , Erika R. Bérczi-Kovács , Evelin Szögi

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

Several countries successfully use centralized matching schemes for school or higher education assignment, or for entry-level labour markets. In this paper we explore the computational aspects of a possible similar scheme for assigning…

Data Structures and Algorithms · Computer Science 2015-01-26 Katarina Cechlarova , Tamas Fleiner , David F. Manlove , Iain McBride