English
Related papers

Related papers: Two-Sided Matching Markets: Impossibility Results …

200 papers

In 1979, Hylland and Zeckhauser \cite{hylland} gave a simple and general scheme for implementing a one-sided matching market using the power of a pricing mechanism. Their method has nice properties -- it is incentive compatible in the large…

Computer Science and Game Theory · Computer Science 2020-04-24 Vijay V. Vazirani , Mihalis Yannakakis

Unlike ordinal-utility matching markets, which are well-developed from the viewpoint of both theory and practice, recent insights from a computer science perspective have left cardinal-utility matching markets in a state of flux. The…

Computer Science and Game Theory · Computer Science 2025-01-06 Thorben Tröbst , Vijay V. Vazirani

The Arrow-Debreu extension of the classic Hylland-Zeckhauser scheme for a one-sided matching market -- called ADHZ in this paper -- has natural applications but has instances which do not admit equilibria. By introducing approximation, we…

Computer Science and Game Theory · Computer Science 2021-07-22 Jugal Garg , Thorben Tröbst , Vijay V. Vazirani

A two-sided market consists of two sets of agents, each of whom have preferences over the other (Airbnb, Upwork, Lyft, Uber, etc.). We propose and analyze a repeated matching problem, where some set of matches occur on each time step, and…

Computer Science and Game Theory · Computer Science 2020-09-22 Sreenivas Gollapudi , Kostas Kollias , Benjamin Plaut

This paper addresses two deficiencies of models in the area of matching-based market design. The first arises from the recent realization that the most prominent solution that uses cardinal utilities, namely the Hylland-Zeckhauser (HZ)…

Computer Science and Game Theory · Computer Science 2023-04-24 Mojtaba Hosseini , Vijay V. Vazirani

Envy-freeness and Pareto Efficiency are two major goals in welfare economics. The existence of an allocation that satisfies both conditions has been studied for a long time. Whether items are indivisible or divisible, it is impossible to…

Computer Science and Game Theory · Computer Science 2019-11-11 Richard Cole , Yixin Tao

In the area of matching-based market design, existing models using cardinal utilities suffer from two deficiencies: First, the Hylland-Zeckhauser (HZ) mechanism, which has remained a classic in economics for one-sided matching markets, is…

Computer Science and Game Theory · Computer Science 2024-11-05 Ioannis Panageas , Thorben Tröbst , Vijay V. Vazirani

We study mechanisms for an allocation of goods among agents, where agents have no incentive to lie about their true values (incentive compatible) and for which no agent will seek to exchange outcomes with another (envy-free). Mechanisms…

Computer Science and Game Theory · Computer Science 2010-03-30 Edith Cohen , Michal Feldman , Amos Fiat , Haim Kaplan , Svetlana Olonetsky

We introduce a new model for two-sided matching which allows us to borrow popular fairness notions from the fair division literature such as envy-freeness up to one good and maximin share guarantee. In our model, each agent is matched to…

Computer Science and Game Theory · Computer Science 2021-07-16 Rupert Freeman , Evi Micha , Nisarg Shah

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

Two-sided matching, such as matching between students and schools, has been applied to various aspects of real life and has been the subject of much research, however, it has been plagued by the fact that efficiency and fairness are…

Computer Science and Game Theory · Computer Science 2025-08-22 Ryota Takeshima , Kei Kimura , Ayumu Kuroki , Temma Wakasugi , Makoto Yokoo

The theory of two-sided matching has been extensively developed and applied to many real-life application domains. As the theory has been applied to increasingly diverse types of environments, researchers and practitioners have encountered…

Computer Science and Game Theory · Computer Science 2024-02-05 Sung-Ho Cho , Kei Kimura , Kiki Liu , Kwei-guu Liu , Zhengjie Liu , Zhaohong Sun , Kentaro Yahiro , Makoto Yokoo

We focus on the one-to-one two-sided matching model with two disjoint sets of agents of equal size, where each agent in a set has preferences on the agents in the other set modeled by a linear order. A matching mechanism associates a set of…

Theoretical Economics · Economics 2024-11-27 Daniela Bubboloni , Michele Gori , Claudia Meo

We study envy-free pricing mechanisms in matching markets with $m$ items and $n$ budget constrained buyers. Each buyer is interested in a subset of the items on sale, and she appraises at some single-value every item in her preference-set.…

Computer Science and Game Theory · Computer Science 2016-10-31 Riccardo Colini-Baldeschi , Stefano Leonardi , Qiang Zhang

According to the fundamental theorems of welfare economics, any competitive equilibrium is Pareto efficient. Unfortunately, competitive equilibrium prices only exist under strong assumptions such as perfectly divisible goods and convex…

Computer Science and Game Theory · Computer Science 2023-05-24 Mete Şeref Ahunbay , Martin Bichler , Johannes Knörr

We study the complexity of the classic Hylland-Zeckhauser scheme [HZ'79] for one-sided matching markets. We show that the problem of finding an $\epsilon$-approximate equilibrium in the HZ scheme is PPAD-hard, and this holds even when…

Computer Science and Game Theory · Computer Science 2021-07-14 Thomas Chen , Xi Chen , Binghui Peng , Mihalis Yannakakis

We study the problem of allocating $m$ indivisible items to $n$ agents with additive utilities. It is desirable for the allocation to be both fair and efficient, which we formalize through the notions of envy-freeness and Pareto-optimality.…

Computer Science and Game Theory · Computer Science 2024-05-08 Yushi Bai , Paul Gölz

We study the classic setting of envy-free pricing, in which a single seller chooses prices for its many items, with the goal of maximizing revenue once the items are allocated. Despite the large body of work addressing such settings, most…

Computer Science and Game Theory · Computer Science 2017-05-03 Elliot Anshelevich , Koushik Kar , Shreyas Sekar

Matching markets play a prominent role in economic theory. A prime example of such a market is the sponsored search market. Here, as in other markets of that kind, market equilibria correspond to feasible, envy free, and bidder optimal…

Computer Science and Game Theory · Computer Science 2012-12-21 Paul Dütting , Monika Henzinger , Ingmar Weber

Multi-unit auctions are a paradigmatic model, where a seller brings multiple units of a good, while several buyers bring monetary endowments. It is well known that Walrasian equilibria do not always exist in this model, however compelling…

Computer Science and Game Theory · Computer Science 2017-10-10 Simina Brânzei , Aris Filos-Ratsikas , Peter Bro Miltersen , Yulong Zeng
‹ Prev 1 2 3 10 Next ›