English
Related papers

Related papers: Selling Two Goods Optimally

200 papers

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

A sequence of recent studies show that even in the simple setting of a single seller and a single buyer with additive, independent valuations over $m$ items, the revenue-maximizing mechanism is prohibitively complex. This problem has been…

Computer Science and Game Theory · Computer Science 2018-01-10 Michal Feldman , Ophir Friedler , Aviad Rubinstein

We study the revenue maximization problem of a seller with n heterogeneous items for sale to a single buyer whose valuation function for sets of items is unknown and drawn from some distribution D. We show that if D is a distribution over…

Computer Science and Game Theory · Computer Science 2018-07-05 Aviad Rubinstein , S. Matthew Weinberg

A monopolist seller of multiple goods screens a buyer whose type is initially unknown to both but drawn from a commonly known distribution. The buyer privately learns about his type via a signal. We derive the seller's optimal mechanism in…

Theoretical Economics · Economics 2021-05-27 Rahul Deb , Anne-Katrin Roesler

Robust mechanism design is a rising alternative to Bayesian mechanism design, which yields designs that do not rely on assumptions like full distributional knowledge. We apply this approach to mechanisms for selling a single item, assuming…

Computer Science and Game Theory · Computer Science 2022-05-24 Nir Bachrach , Inbal Talgam-Cohen

We study a classic Bayesian mechanism design setting of monopoly problem for an additive buyer in the presence of budgets. In this setting a monopolist seller with $m$ heterogeneous items faces a single buyer and seeks to maximize her…

Computer Science and Game Theory · Computer Science 2018-10-09 Yu Cheng , Nick Gravin , Kamesh Munagala , Kangning Wang

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

In the multi-unit pricing problem, multiple units of a single item are for sale. A buyer's valuation for $n$ units of the item is $v \min \{ n, d\} $, where the per unit valuation $v$ and the capacity $d$ are private information of the…

Computer Science and Game Theory · Computer Science 2017-04-18 Nikhil R. Devanur , Nima Haghpanah , Christos-Alexandros Psomas

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

A buyer wishes to purchase a durable good from a seller who in each period chooses a mechanism under limited commitment. The buyer's valuation is binary and fully persistent. We show that posted prices implement all equilibrium outcomes of…

Theoretical Economics · Economics 2021-06-01 Laura Doval , Vasiliki Skreta

We provide simple and approximately revenue-optimal mechanisms in the multi-item multi-bidder settings. We unify and improve all previous results, as well as generalize the results to broader cases. In particular, we prove that the better…

Computer Science and Game Theory · Computer Science 2019-08-27 Yang Cai , Mingfei Zhao

A seller wants to sell an item to $n$ buyers. Buyer valuations are drawn i.i.d. from a distribution unknown to the seller; the seller only knows that the support is included in $[a, b]$. To be robust, the seller chooses a DSIC mechanism…

Theoretical Economics · Economics 2025-01-03 Jerry Anunrojwong , Santiago R. Balseiro , Omar Besbes

We consider a model of bilateral trade with private values. The value of the buyer and the cost of the seller are jointly distributed. The true joint distribution is unknown to the designer, however, the marginal distributions of the value…

Theoretical Economics · Economics 2023-01-02 Komal Malik

We analyze a model of selling a single object to a principal-agent pair who want to acquire the object for a firm. The principal and the agent have different assessments of the object's value to the firm. The agent is budget-constrained…

Theoretical Economics · Economics 2024-10-07 Debasis Mishra , Kolagani Paramahamsa

We study multi-item profit maximization when there is an underlying distribution over buyers' values. In practice, a full description of the distribution is typically unavailable, so we study the setting where the mechanism designer only…

Machine Learning · Computer Science 2023-05-09 Maria-Florina Balcan , Tuomas Sandholm , Ellen Vitercik

We study the mechanism design problem of selling $k$ items to unit-demand buyers with private valuations for the items. A buyer either participates directly in the auction or is represented by an intermediary, who represents a subset of…

Computer Science and Game Theory · Computer Science 2021-11-23 Gagan Aggarwal , Kshipra Bhawalkar , Guru Guruganesh , Andres Perlroth

A seller chooses a reserve price in a second-price auction to maximize worst-case expected revenue when she knows only the mean of value distribution and an upper bound on either values themselves or variance. Values are private and iid.…

Theoretical Economics · Economics 2020-08-10 Alex Suzdaltsev

Problem definition: Traditional monopoly pricing assumes sellers have full information about consumer valuations. We consider monopoly pricing under limited information, where a seller only knows the mean, variance and support of the…

Optimization and Control · Mathematics 2026-03-30 Tim S. G. van Eck , Pieter Kleer , Johan S. H. van Leeuwaarden

Multi-item revenue-optimal mechanisms are known to be extremely complex, often offering buyers randomized lotteries of goods. In the standard buy-one model, it is known that optimal mechanisms can yield revenue infinitely higher than that…

Computer Science and Game Theory · Computer Science 2022-11-22 Sepehr Assadi , Vikram Kher , George Li , Ariel Schvartzman

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