English
Related papers

Related papers: Improved Approximation to First-Best Gains-from-Tr…

200 papers

We consider two canonical Bayesian mechanism design settings. In the single-item setting, we prove tight approximation ratio for anonymous pricing: compared with Myerson Auction, it extracts at least $\frac{1}{2.62}$-fraction of revenue;…

Computer Science and Game Theory · Computer Science 2018-11-05 Yaonan Jin , Pinyan Lu , Qi Qi , Zhihao Gavin Tang , Tao Xiao

We initiate the study of single-sample bilateral trade with a broker, drawing an analogy to the setting of single-sample bilateral trade without a broker considered in Babaioff et al. (2020) and Cai and Wu (2023). Our model captures the…

Computer Science and Game Theory · Computer Science 2026-03-04 MohammadTaghi Hajiaghayi , Gary Peng , Suho Shin

A celebrated impossibility result by Myerson and Satterthwaite (1983) shows that any truthful mechanism for two-sided markets that maximizes social welfare must run a deficit, resulting in a necessity to relax welfare efficiency and the use…

Computer Science and Game Theory · Computer Science 2024-02-20 Paul Dütting , Federico Fusco , Philip Lazos , Stefano Leonardi , Rebecca Reiffenhäuser

I construct a novel random double auction as a robust bilateral trading mechanism for a profit-maximizing intermediary who facilitates trade between a buyer and a seller. It works as follows. The intermediary publicly commits to charging a…

Theoretical Economics · Economics 2022-05-11 Wanchang Zhang

We study a classical Bayesian mechanism design problem where a seller is selling multiple items to multiple buyers. We consider the case where the seller has costs to produce the items, and these costs are private information to the seller.…

Computer Science and Game Theory · Computer Science 2020-04-20 Yang Cai , Mingfei Zhao

The intuition that profit is optimized by maximizing marginal revenue is a guiding principle in microeconomics. In the classical auction theory for agents with linear utility and single-dimensional preferences, Bulow and Roberts (1989) show…

Computer Science and Game Theory · Computer Science 2014-06-06 Saeed Alaei , Hu Fu , Nima Haghpanah , Jason Hartline

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 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 consider the problem of welfare maximization in two-sided markets using simple mechanisms that are prior-independent. The Myerson-Satterthwaite impossibility theorem shows that even for bilateral trade, there is no feasible (IR,…

Computer Science and Game Theory · Computer Science 2019-12-24 Moshe Babaioff , Kira Goldner , Yannai A. Gonczarowski

We study the bilateral trade problem: one seller, one buyer and a single, indivisible item for sale. It is well known that there is no fully-efficient and incentive compatible mechanism for this problem that maintains a balanced budget. We…

Computer Science and Game Theory · Computer Science 2018-11-20 Liad Blumrosen , Shahar Dobzinski

We consider a monopolist seller with $n$ heterogeneous items, facing a single buyer. The buyer has a value for each item drawn independently according to (non-identical) distributions, and her value for a set of items is additive. The…

Computer Science and Game Theory · Computer Science 2020-08-03 Moshe Babaioff , Nicole Immorlica , Brendan Lucier , S. Matthew Weinberg

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 revenue maximization through sequential posted-price (SPP) mechanisms in single-dimensional settings with $n$ buyers and independent but not necessarily identical value distributions. We construct the SPP mechanisms by considering…

Computer Science and Game Theory · Computer Science 2021-01-11 Hedyeh Beyhaghi , Negin Golrezaei , Renato Paes Leme , Martin Pal , Balasubramanian Sivan

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 study a seller who sells a single good to multiple bidders with uncertainty over the joint distribution of bidders' valuations, as well as bidders' higher-order beliefs about their opponents. The seller only knows the (possibly…

Theoretical Economics · Economics 2022-02-16 Ethan Che

Most work in mechanism design assumes that buyers are risk neutral; some considers risk aversion arising due to a non-linear utility for money. Yet behavioral studies have established that real agents exhibit risk attitudes which cannot be…

Computer Science and Game Theory · Computer Science 2018-03-13 Shuchi Chawla , Kira Goldner , J. Benjamin Miller , Emmanouil Pountourakis

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

Bilateral trade, a fundamental topic in economics, models the problem of intermediating between two strategic agents, a seller and a buyer, willing to trade a good for which they hold private valuations. Despite the simplicity of this…

Machine Learning · Computer Science 2024-02-20 Nicolò Cesa-Bianchi , Tommaso Cesari , Roberto Colomboni , Federico Fusco , Stefano Leonardi

We study a repeated trading problem in which a mechanism designer facilitates trade between a single seller and multiple buyers. Our model generalizes the classic bilateral trade setting to a multi-buyer environment. Specifically, the…

Computer Science and Game Theory · Computer Science 2025-03-04 Anna Lunghi , Matteo Castiglioni , Alberto Marchesi

Mechanism design for one-sided markets has been investigated for several decades in economics and in computer science. More recently, there has been an increased attention on mechanisms for two-sided markets, in which buyers and sellers act…

Computer Science and Game Theory · Computer Science 2021-03-09 Riccardo Colini-Baldeschi , Paul Goldberg , Bart de Keijzer , Stefano Leonardi , Tim Roughgarden , Stefano Turchetta