English
Related papers

Related papers: Fixed-Price Approximations in Bilateral Trade

200 papers

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

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 bilateral trade problem where a seller owns a single indivisible item, and a potential buyer seeks to purchase it. Previous mechanisms for this problem only considered the case where the values of the buyer and the seller are…

Computer Science and Game Theory · Computer Science 2024-04-17 Shahar Dobzinski , Ariel Shaulker

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

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 study the fair allocation of indivisible items to $n$ agents to maximize the utilitarian social welfare, where the fairness criterion is envy-free up to one item and there are only two different utility functions shared by the agents. We…

Computer Science and Game Theory · Computer Science 2025-09-12 Jiaxuan Ma , Yong Chen , Guangting Chen , Mingyang Gong , Guohui Lin , An Zhang

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

Welfare maximization in bilateral trade has been extensively studied in recent years. Previous literature obtained incentive-compatible approximation mechanisms only for the private values case. In this paper, we study welfare maximization…

Computer Science and Game Theory · Computer Science 2025-07-01 Shahar Dobzinski , Alon Eden , Kira Goldner , Ariel Shaulker , Thodoris Tsilivis

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 study fair division of indivisible goods in a single-parameter environment. In particular, we develop truthful social welfare maximizing mechanisms for fairly allocating indivisible goods. Our fairness guarantees are in terms of solution…

Computer Science and Game Theory · Computer Science 2019-01-29 Siddharth Barman , Ganesh Ghalme , Shweta Jain , Pooja Kulkarni , Shivika Narang

Consider a trade market with one seller and multiple buyers. The seller aims to sell an indivisible item and maximize their revenue. This paper focuses on a simple and popular mechanism--the fixed-price mechanism. Unlike the standard…

Computer Science and Game Theory · Computer Science 2024-11-19 Zhikang Fan , Weiran Shen

Bilateral trade models the task of intermediating between two strategic agents, a seller and a buyer, willing to trade a good for which they hold private valuations. We study this problem from the perspective of a broker, in a regret…

Computer Science and Game Theory · Computer Science 2025-09-29 Simone Di Gregorio , Paul Dütting , Federico Fusco , Chris Schwiegelshohn

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

A central challenge in mechanism design is to develop truthful trade mechanisms that maximize the expected gains-from-trade (GFT) in two-sided markets with strategic agents. As achieving the full GFT is generally impossible, much of the…

Computer Science and Game Theory · Computer Science 2026-04-02 Moshe Babaioff , Aviad Rubinstein , Xizhi Tan , Kangning Wang

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

Selling a single item to $n$ self-interested buyers is a fundamental problem in economics, where the two objectives typically considered are welfare maximization and revenue maximization. Since the optimal mechanisms are often impractical…

Computer Science and Game Theory · Computer Science 2024-11-06 Billy Jin , Thomas Kesselheim , Will Ma , Sahil Singla
‹ Prev 1 2 3 10 Next ›