English
Related papers

Related papers: Approximating Gains-from-Trade in Matching Markets

200 papers

We design simple mechanisms to approximate the Gains from Trade (GFT) in two-sided markets with multiple unit-supply sellers and multiple unit-demand buyers. A classical impossibility result by Myerson and Satterthwaite showed that even…

Computer Science and Game Theory · Computer Science 2017-06-20 Johannes Brustle , Yang Cai , Fa Wu , Mingfei Zhao

We study bilateral trade with a broker, where a buyer and seller interact exclusively through the broker. The broker strategically maximizes her payoff through arbitrage by trading with the buyer and seller at different prices. We study…

Computer Science and Game Theory · Computer Science 2025-01-09 Ilya Hajiaghayi , MohammadTaghi Hajiaghayi , Gary Peng , Suho Shin

Bilateral trade is a fundamental economic scenario comprising a strategically acting buyer and seller, each holding valuations for the item, drawn from publicly known distributions. A mechanism is supposed to facilitate trade between these…

Computer Science and Game Theory · Computer Science 2017-10-24 Riccardo Colini-Baldeschi , Paul Goldberg , Bart de Keijzer , Stefano Leonardi , Stefano Turchetta

The primary contribution of this paper resides in devising constant-factor approximation guarantees for revenue maximization in two-sided matching markets, under general pairwise rewards. A major distinction between our work and…

Computer Science and Game Theory · Computer Science 2024-11-26 Dan Nissim , Danny Segev , Alfredo Torrico

We study bilateral trade between two strategic agents. The celebrated result of Myerson and Satterthwaite states that in general, no incentive-compatible, individually rational and weakly budget balanced mechanism can be efficient. I.e., no…

Computer Science and Game Theory · Computer Science 2021-11-08 Yuan Deng , Jieming Mao , Balasubramanian Sivan , Kangning Wang

We consider the problem of maximizing the gains from trade (GFT) in two-sided markets. The seminal impossibility result by Myerson and Satterthwaite shows that even for bilateral trade, there is no individually rational (IR), Bayesian…

Computer Science and Game Theory · Computer Science 2024-04-01 Yang Cai , Christopher Liaw , Aranyak Mehta , Mingfei Zhao

We study the two-agent single-item bilateral trade. Ideally, the trade should happen whenever the buyer's value for the item exceeds the seller's cost. However, the classical result of Myerson and Satterthwaite showed that no mechanism can…

Computer Science and Game Theory · Computer Science 2022-05-03 Yumou Fei

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 consider the bilateral trade problem, in which two agents trade a single indivisible item. It is known that the only dominant-strategy truthful mechanism is the fixed-price mechanism: given commonly known distributions of the buyer's…

Computer Science and Game Theory · Computer Science 2021-12-21 Zi Yang Kang , Francisco Pernice , Jan Vondrák

We consider the impact of fairness requirements on the social efficiency of truthful mechanisms for trade, focusing on Bayesian bilateral-trade settings. Unlike the full information case in which all gains-from-trade can be realized and…

Computer Science and Game Theory · Computer Science 2025-02-27 Moshe Babaioff , Yiding Feng , Noam Manaker Morag

We design novel mechanisms for welfare-maximization in two-sided markets. That is, there are buyers willing to purchase items and sellers holding items initially, both acting rationally and strategically in order to maximize utility. Our…

Computer Science and Game Theory · Computer Science 2021-06-01 Alexander Braun , Thomas Kesselheim

We study resource allocation in two-sided markets from a fundamental perspective and introduce a general modeling and algorithmic framework to effectively incorporate the complex and multidimensional aspects of fairness. Our main technical…

Computer Science and Game Theory · Computer Science 2025-06-03 Javier Cembrano , Andrés Moraga , Victor Verdugo

We study how to maximize the broker's (expected) profit in a two-sided market, where she buys items from a set of sellers and resells them to a set of buyers. Each seller has a single item to sell and holds a private value on her item, and…

Computer Science and Game Theory · Computer Science 2019-05-24 Jing Chen , Bo Li , Yingkai Li

We study gains from trade in multi-dimensional two-sided markets. Specifically, we focus on a setting with $n$ heterogeneous items, where each item is owned by a different seller $i$, and there is a constrained-additive buyer with…

Computer Science and Game Theory · Computer Science 2022-03-15 Yang Cai , Kira Goldner , Steven Ma , Mingfei Zhao

We study the problem of designing a two-sided market (double auction) to maximize the gains from trade (social welfare) under the constraints of (dominant-strategy) incentive compatibility and budget-balance. Our goal is to do so for an…

Computer Science and Game Theory · Computer Science 2024-06-21 Moshe Babaioff , Amitai Frey , Noam Nisan

We study truthful mechanisms for matching and related problems in a partial information setting, where the agents' true utilities are hidden, and the algorithm only has access to ordinal preference information. Our model is motivated by the…

Computer Science and Game Theory · Computer Science 2016-10-20 Elliot Anshelevich , Shreyas Sekar

We investigate online pricing in two-sided markets where a platform repeatedly posts prices based on binary accept/reject feedback to maximize gains-from-trade (GFT) or profit. We characterize the regret achievable across three mechanism…

Computer Science and Game Theory · Computer Science 2026-02-13 Yiding Feng , Mengfan Ma , Bo Peng , Zongqi Wan

In markets such as digital advertising auctions, bidders want to maximize value rather than payoff. This is different to the utility functions typically assumed in auction theory and leads to different strategies and outcomes. We refer to…

Computer Science and Game Theory · Computer Science 2016-07-14 Salman Fadaei , Martin Bichler

We address the problem of maximizing Gain from Trade (GFT) in repeated buyer-seller exchanges subject to global budget balance constraints. While this problem is well-understood in purely adversarial and stochastic settings, these…

Computer Science and Game Theory · Computer Science 2026-05-12 Anna Lunghi , Matteo Castiglioni , Alberto Marchesi

We study truthful mechanisms for approximating the Maximin-Share (MMS) allocation of agents with additive valuations for indivisible goods. Algorithmically, constant factor approximations exist for the problem for any number of agents. When…

Computer Science and Game Theory · Computer Science 2024-06-12 Ilan Reuven Cohen , Alon Eden , Talya Eden , Arsen Vasilyan
‹ Prev 1 2 3 10 Next ›