English
Related papers

Related papers: Optimal Robust Mechanism in Bilateral Trading

200 papers

We study mechanism design when agents may have hidden secondary goals which will manifest as non-trivial preferences among outcomes for which their primary utility is the same. We show that in such cases, a mechanism is robust against…

Computer Science and Game Theory · Computer Science 2023-07-25 Renato Paes Leme , Jon Schneider , Hanrui Zhang

We study auctions that are robust at any scale, i.e., they can be applied to sell both expensive and cheap items and achieve the best multiplicative approximations of the optimal revenue in the worst case. We show that the optimal mechanism…

Computer Science and Game Theory · Computer Science 2025-10-27 Jason Hartline , Aleck Johnsen , Yingkai Li

In this paper we consider multidimensional mechanism design problem for selling discrete substitutable items to a group of buyers. Previous work on this problem mostly focus on stochastic description of valuations used by the seller.…

Computer Science and Game Theory · Computer Science 2017-01-05 Maciej Drwal

We consider the classical mathematical economics problem of {\em Bayesian optimal mechanism design} where a principal aims to optimize expected revenue when allocating resources to self-interested agents with preferences drawn from a known…

Computer Science and Game Theory · Computer Science 2010-01-15 Shuchi Chawla , Jason Hartline , David Malec , Balasubramanian Sivan

We study the problem of designing posted-price mechanisms in order to sell a single unit of a single item within a finite period of time. Motivated by real-world problems, such as, e.g., long-term rental of rooms and apartments, we assume…

Computer Science and Game Theory · Computer Science 2020-12-11 Giulia Romano , Gianluca Tartaglia , Alberto Marchesi , Nicola Gatti

We study the problem of multi-dimensional revenue maximization when selling $m$ items to a buyer that has additive valuations for them, drawn from a (possibly correlated) prior distribution. Unlike traditional Bayesian auction design, we…

Computer Science and Game Theory · Computer Science 2022-04-29 Yiannis Giannakopoulos , Diogo Poças , Alexandros Tsigonias-Dimitriadis

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

This paper studies optimal auction design when valuations depend endogenously on post-auction collaboration between the seller and the winning bidder. Both parties exert non-contractible efforts after the auction, generating a double moral…

Theoretical Economics · Economics 2026-04-21 Dazhong Wang , Ruqu Wang , Xinyi Xu

The seminal impossibility result of Myerson and Satterthwaite (1983) states that for bilateral trade, there is no mechanism that is individually rational (IR), incentive compatible (IC), weakly budget balanced, and efficient. This has led…

Computer Science and Game Theory · Computer Science 2018-02-23 Moshe Babaioff , Yang Cai , Yannai A. Gonczarowski , Mingfei Zhao

I study the design of auctions in which the auctioneer is assumed to have information only about the marginal distribution of a generic bidder's valuation, but does not know the correlation structure of the joint distribution of bidders'…

Theoretical Economics · Economics 2022-05-10 Wanchang Zhang

We consider the problem of designing incentive-compatible, ex-post individually rational (IR) mechanisms for covering problems in the Bayesian setting, where players' types are drawn from an underlying distribution and may be correlated,…

Computer Science and Game Theory · Computer Science 2016-09-30 Hadi Minooei , Chaitanya Swamy

We study the power of price discrimination via an intermediary in bilateral trade, when there is a revenue-maximizing seller selling an item to a buyer with a private value drawn from a prior. Between the seller and the buyer, there is an…

Computer Science and Game Theory · Computer Science 2023-04-28 Shao-Heng Ko , Kamesh Munagala

In social decision-making among strategic agents, a universal focus lies on the balance between social and individual interests. Socially efficient mechanisms are thus desirably designed to not only maximize the social welfare but also…

Computer Science and Game Theory · Computer Science 2024-07-29 Hirota Kinoshita , Takayuki Osogami , Kohei Miyaguchi

We provide sufficient conditions for revenue maximization in a two-good monopoly where the buyer's values for the items come from independent (but not necessarily identical) distributions over bounded intervals. Under certain distributional…

Computer Science and Game Theory · Computer Science 2015-11-24 Yiannis Giannakopoulos , Elias Koutsoupias

This paper introduces dynamic mechanism design in an elementary fashion. We first examine optimal dynamic mechanisms: We find necessary and sufficient conditions for perfect Bayesian incentive compatibility and formulate the optimal dynamic…

Theoretical Economics · Economics 2024-09-10 Kiho Yoon

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

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

Very few exact solutions are known for the monopolist's $k$-item $n$-buyer maximum revenue problem with additive valuation in which $k, n >1$ and the buyers $i$ have independent private distributions $F^j_i$ on items $j$. In this paper we…

Computer Science and Game Theory · Computer Science 2016-07-14 Andrew Chi-Chih Yao

This paper explores the gain maximization problem of two nations engaging in non-cooperative bilateral trade. Probabilistic model of an exchange of commodities under different price systems is considered. Volume of commodities exchanged…

Theoretical Economics · Economics 2020-01-09 Tsotne Kutalia , Revaz Tevzadze

This article aims to introduce the paradigm of distributional robustness from the field of convex optimization to tackle optimal design problems under uncertainty. We consider realistic situations where the physical model, and thereby the…

Optimization and Control · Mathematics 2025-07-30 Charles Dapogny , Julien Prando , Boris Thibert