English
Related papers

Related papers: Selling Two Goods Optimally

200 papers

We study robust mechanisms to sell a common-value good. We assume that the mechanism designer knows the prior distribution of the buyers' common value but is unsure of the buyers' information structure about the common value. We use linear…

Computer Science and Game Theory · Computer Science 2016-11-22 Songzi Du

Maximizing the revenue from selling two or more goods has been shown to require the use of $nonmonotonic$ mechanisms, where a higher-valuation buyer may pay less than a lower-valuation one. Here we show that the restriction to $monotonic$…

Computer Science and Game Theory · Computer Science 2024-06-13 Ran Ben-Moshe , Sergiu Hart , Noam Nisan

We develop a general duality-theory framework for revenue maximization in additive Bayesian auctions. The framework extends linear programming duality and complementarity to constraints with partial derivatives. The dual system reveals the…

Computer Science and Game Theory · Computer Science 2018-01-16 Yiannis Giannakopoulos , Elias Koutsoupias

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

When selling many goods with independent valuations, we develop a distributionally robust framework, consisting of a two-player game between seller and nature. The seller has only limited knowledge about the value distribution. The seller…

Computer Science and Game Theory · Computer Science 2026-03-30 Tim S. G. van Eck , Pieter Kleer , Johan S. H. van Leeuwaarden

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

This paper studies convex duality in optimal investment and contingent claim valuation in markets where traded assets may be subject to nonlinear trading costs and portfolio constraints. Under fairly general conditions, the dual expressions…

Mathematical Finance · Quantitative Finance 2016-03-10 Teemu Pennanen , Ari-Pekka Perkkiö

I study the optimal allocation of positional goods in the presence of externalities arising from consumers' concerns about relative consumption. Applications include luxury goods, priority services, education, and organizational…

Theoretical Economics · Economics 2025-10-10 Peiran Xiao

We consider a revenue-maximizing seller with $m$ heterogeneous items and a single buyer whose valuation $v$ for the items may exhibit both substitutes (i.e., for some $S, T$, $v(S \cup T) < v(S) + v(T)$) and complements (i.e., for some $S,…

Computer Science and Game Theory · Computer Science 2017-04-11 Alon Eden , Michal Feldman , Ophir Friedler , Inbal Talgam-Cohen , S. Matthew Weinberg

A fundamental economic question is that of designing revenue-maximizing mechanisms in dynamic environments. This paper considers a simple yet compelling market model to tackle this question, where forward-looking buyers arrive at the market…

Theoretical Economics · Economics 2024-10-16 Jose Correa , Andres Cristi , Laura Vargas Koch

Two sellers compete to sell identical products to a single buyer. Each seller chooses an arbitrary mechanism, possibly involving lotteries, to sell their product. The utility-maximizing buyer can choose to participate in one or both…

Computer Science and Game Theory · Computer Science 2025-05-27 Brendan Lucier , Raghuvansh R. Saxena

We provide a characterization of revenue-optimal dynamic mechanisms in settings where a monopolist sells k items over k periods to a buyer who realizes his value for item i in the beginning of period i. We require that the mechanism…

Computer Science and Game Theory · Computer Science 2016-07-06 Itai Ashlagi , Constantinos Daskalakis , Nima Haghpanah

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 investigate approximately optimal mechanisms in settings where bidders' utility functions are non-linear; specifically, convex, with respect to payments (such settings arise, for instance, in procurement auctions for energy). We provide…

Computer Science and Game Theory · Computer Science 2017-02-23 Amy Greenwald , Takehiro Oyakawa , Vasilis Syrgkanis

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

We study multi-product monopoly pricing where the seller jointly designs the selling mechanism and the information structure for the buyer to learn his values. Unlike the case with exogenous information, we show that when the seller…

Computer Science and Game Theory · Computer Science 2025-10-29 Yang Cai , Yingkai Li , Jinzhao Wu

We study the problem of designing revenue-maximizing mechanisms for a selfish mediator who facilitates trade between a buyer and a seller. We consider a setting where the mediator does not have information advantage and the buyer's…

Computer Science and Game Theory · Computer Science 2026-03-10 Zhikang Fan , Weiran Shen , Shaojie Tang , Yao Wang

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 a multiproduct monopoly pricing model. We provide sufficient conditions under which the optimal mechanism can be implemented via upgrade pricing -- a menu of product bundles that are nested in the strong set order. Our approach…

Computer Science and Game Theory · Computer Science 2021-12-03 Dirk Bergemann , Alessandro Bonatti , Andreas Haupt , Alex Smolin

In multi-item screening, optimal selling mechanisms are challenging to characterize and implement, even with full knowledge of valuation distributions. In this paper, we aim to develop tractable, interpretable, and implementable mechanisms…

Theoretical Economics · Economics 2025-10-20 Shixin Wang