English
Related papers

Related papers: Approximately Efficient Bilateral Trade with Sampl…

200 papers

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 continue the study of the performance for fixed-price mechanisms in the bilateral trade problem, and improve approximation ratios of welfare-optimal mechanisms in several settings. Specifically, in the case where only the buyer…

Computer Science and Game Theory · Computer Science 2023-03-29 Zhengyang Liu , Zeyu Ren , Zihe Wang

We study the problem of social welfare maximization in bilateral trade, where two agents, a buyer and a seller, trade an indivisible item. We consider arguably the simplest form of mechanisms -- the fixed-price mechanisms, where the…

Computer Science and Game Theory · Computer Science 2023-06-21 Yang Cai , Jinzhao Wu

This paper studies a general class of social choice problems in which agents' payoff functions (or types) are privately observable random variables, and monetary transfers are not available. We consider cardinal social choice functions…

Theoretical Economics · Economics 2024-08-20 Kazuya Kikuchi , Yukio Koriyama

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

What fraction of the potential social surplus in an environment can be extracted by a revenue-maximizing monopolist? We investigate this problem in Bayesian single-parameter environments with independent private values. The precise answer…

Computer Science and Game Theory · Computer Science 2013-05-03 Robert Kleinberg , Yang Yuan

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

This paper reexamines the classic problem of revenue maximization in single-item auctions with $n$ buyers under the lens of the robust optimization framework. The celebrated Myerson's mechanism is the format that maximizes the seller's…

Computer Science and Game Theory · Computer Science 2024-09-16 Nick Gravin , Zhiqi Wang

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 consider the fundamental scenario where a single item is to be sold to one of two agents. Both agents draw their valuation for the item from the same probability distribution. However, only one of them submits a bid to the mechanism. The…

Computer Science and Game Theory · Computer Science 2025-08-26 Ioannis Caragiannis , Georgios Kalantzis

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

The Gibbard-Satterthwaite Impossibility Theorem holds that dictatorship is the only Pareto optimal and strategyproof social choice function on the full domain of preferences. Much of the work in mechanism design aims at getting around this…

Computer Science and Game Theory · Computer Science 2017-03-21 Sophie Bade , Yannai A. Gonczarowski

We study the asymptotic average-case efficiency of static and anonymous posted prices for $n$ agents and $m(n)$ multiple identical items with $m(n)=o\left(\frac{n}{\log n}\right)$. When valuations are drawn i.i.d from some fixed continuous…

Computer Science and Game Theory · Computer Science 2019-01-09 Urban Larsson , Ron Lavi

We investigate the power of randomness in the context of a fundamental Bayesian optimal mechanism design problem--a single seller aims to maximize expected revenue by allocating multiple kinds of resources to "unit-demand" agents with…

Computer Science and Game Theory · Computer Science 2010-02-24 Shuchi Chawla , David Malec , Balasubramanian Sivan

Social goods are goods that grant value not only to their owners but also to the owners' surroundings, be it their families, friends or office mates. The benefit a non-owner derives from the good is affected by many factors, including the…

Computer Science and Game Theory · Computer Science 2017-07-04 Alon Eden , Tomer Ezra , Michal Feldman

A truthful mechanism for a Bayesian single-item auction results with some ex-ante revenue for the seller, and some ex-ante total surplus for the buyers. We study the Pareto frontier of the set of seller-buyers ex-ante utilities, generated…

Computer Science and Game Theory · Computer Science 2026-02-13 Moshe Babaioff , Sijin Chen , Zhaohua Chen , Yiding Feng

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

We study the power of item-pricing as a tool for approximately optimizing social welfare in a combinatorial market. We consider markets with $m$ indivisible items and $n$ buyers. The goal is to set prices to the items so that, when agents…

Computer Science and Game Theory · Computer Science 2015-11-10 Michal Feldman , Nick Gravin , Brendan Lucier

We consider the sample complexity of revenue maximization for multiple bidders in unrestricted multi-dimensional settings. Specifically, we study the standard model of $n$ additive bidders whose values for $m$ heterogeneous items are drawn…

Computer Science and Game Theory · Computer Science 2021-04-13 Yannai A. Gonczarowski , S. Matthew Weinberg

In the design and analysis of revenue-maximizing auctions, auction performance is typically measured with respect to a prior distribution over inputs. The most obvious source for such a distribution is past data. The goal is to understand…

Computer Science and Game Theory · Computer Science 2015-11-30 Richard Cole , Tim Roughgarden