English
Related papers

Related papers: Robust Revenue Maximization Under Minimal Statisti…

200 papers

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 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 this paper, we introduce a Bayesian revenue-maximizing mechanism design model where the items have fixed, exogenously-given prices. Buyers are unit-demand and have an ordinal ranking over purchasing either one of these items at its given…

Computer Science and Game Theory · Computer Science 2020-10-16 Will Ma

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 consider the problem of maximizing revenue when selling 2 items to a single buyer with known valuation distributions. Hart and Nisan showed that selling each item separately using the optimal Myerson's price, gains at least half of the…

Computer Science and Game Theory · Computer Science 2017-12-12 Ron Kupfer

We investigate the extent to which price updates can increase the revenue of a seller with little prior information on demand. We study prior-free revenue maximization for a seller with unlimited supply of n item types facing m myopic…

Computer Science and Game Theory · Computer Science 2010-11-02 Maria-Florina Balcan , Florin Constantin

A monopolistic seller aims to sell an indivisible item to multiple potential buyers. Each buyer's valuation depends on their private type and the item's quality. The seller can observe the quality but it is unknown to buyers. This quality…

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

We study the revenue guarantees and approximability of item pricing. Recent work shows that with $n$ heterogeneous items, item-pricing guarantees an $O(\log n)$ approximation to the optimal revenue achievable by any (buy-many) mechanism,…

Computer Science and Game Theory · Computer Science 2021-11-08 Shuchi Chawla , Rojin Rezvan , Yifeng Teng , Christos Tzamos

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 study the problem of selling $n$ items to a single buyer with an additive valuation function. We consider the valuation of the items to be correlated, i.e., desirabilities of the buyer for the items are not drawn independently. Ideally,…

Computer Science and Game Theory · Computer Science 2015-07-23 MohammadHossein Bateni , Sina Dehghani , MohammadTaghi Hajiaghayi , Saeed Seddighin

We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with $n$ items caters to $m$ buyers with unknown subadditive valuation functions who arrive in a sequence. The seller sets…

Computer Science and Game Theory · Computer Science 2009-05-21 Tanmoy Chakraborty , Zhiyi Huang , Sanjeev Khanna

We study the revenue maximization problem with an imprecisely estimated distribution of a single buyer or several independent and identically distributed buyers given that this estimation is not far away from the true distribution. We use…

Computer Science and Game Theory · Computer Science 2019-03-05 Yingkai Li , Pinyan Lu , Haoran Ye

We consider the problem of the optimization of bidding strategies in prior-dependent revenue-maximizing auctions, when the seller fixes the reserve prices based on the bid distributions. Our study is done in the setting where one bidder is…

Computer Science and Game Theory · Computer Science 2019-05-15 Thomas Nedelec , Noureddine El Karoui , Vianney Perchet

We study revenue maximization in multi-item auctions, where bidders have subadditive valuations over independent items. Providing a simple mechanism that is approximately revenue-optimal in this setting is a major open problem in mechanism…

Computer Science and Game Theory · Computer Science 2023-10-13 Yang Cai , Ziyun Chen , Jinzhao Wu

We study revenue maximization in a buyer-seller setting where the seller has a single object and the buyer has both a private valuation and a private budget. Private budgets complicate the classic single-product monopoly problem, making…

Computer Science and Game Theory · Computer Science 2026-04-30 Juan Carlos Carbajal , Ahuva Mualem

Consider a seller with m heterogeneous items for sale to a single additive buyer whose values for the items are arbitrarily correlated. It was previously shown that, in such settings, distributions exist for which the seller's optimal…

Computer Science and Game Theory · Computer Science 2018-12-03 Christos-Alexandros Psomas , Ariel Schvartzman , S. Matthew Weinberg

We study revenue maximization in multi-item multi-bidder auctions under the natural item-independence assumption - a classical problem in Multi-Dimensional Bayesian Mechanism Design. One of the biggest challenges in this area is developing…

Computer Science and Game Theory · Computer Science 2022-04-12 Yang Cai , Argyris Oikonomou , 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

This study investigates a robust screening problem under distributional ambiguity, where a seller is uncertain about a buyer's true valuation distribution, knowing only that it lies near a reference distribution measured by the Wasserstein…

Optimization and Control · Mathematics 2026-05-19 Shumin Ma , Daniel Zhuoyu Long , Lijian Lu

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