English
Related papers

Related papers: The Optimality of Upgrade Pricing

200 papers

This paper studies a monopolist selling multiple goods to a consumer with one-dimensional private types. I provide a sufficient condition under which the monopolist's problem is equivalent to finding the upper envelope of the marginal…

Theoretical Economics · Economics 2025-10-28 Zhiming Feng

We apply marginal analysis \`a la Bulow and Roberts (1989) to characterize revenue-maximizing selling mechanisms for a multiproduct monopoly. We derive marginal revenue from price perturbations over arbitrary sets of bundles and show that…

Theoretical Economics · Economics 2026-02-03 Yi-Chun Chen , Zhengqing Gui

Using duality theory techniques we derive simple, closed-form formulas for bounding the optimal revenue of a monopolist selling many heterogeneous goods, in the case where the buyer's valuations for the items come i.i.d. from a uniform…

Computer Science and Game Theory · Computer Science 2015-10-14 Yiannis Giannakopoulos

Pricing decisions are often made when market information is still poor. In turn, existing theoretical models often reason about the response of optimal prices to changing market characteristics without exploiting all available information…

Optimization and Control · Mathematics 2021-07-19 Stefanos Leonardos , Costis Melolidakis , Constandina Koki

We consider optimal mechanism design for the case with one buyer and two items. The buyer's valuations towards the two items are independent and additive. In this setting, optimal mechanism is unknown for general valuation distributions. We…

Computer Science and Game Theory · Computer Science 2014-04-30 Zihe Wang , Pingzhong Tang

We study optimal bundling when consumers differ in one dimension. We introduce a partial order on the set of bundles defined by (i) set inclusion and (ii) sales volumes (if sold alone and priced optimally). We show that if the undominated…

Theoretical Economics · Economics 2023-04-11 Frank Yang

We characterize optimal mechanisms for the multiple-good monopoly problem and provide a framework to find them. We show that a mechanism is optimal if and only if a measure $\mu$ derived from the buyer's type distribution satisfies certain…

Computer Science and Game Theory · Computer Science 2017-09-07 Constantinos Daskalakis , Alan Deckelbaum , Christos Tzamos

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

A multi-product monopolist faces a buyer who is privately informed about his valuations for the goods. As is well-known, optimal mechanisms are in general complicated, while simple mechanisms -- such as pure bundling or separate sales --…

Theoretical Economics · Economics 2025-09-03 Mira Frick , Ryota Iijima , Yuhta Ishii

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

We consider a principal seller with $m$ heterogeneous products to sell to an additive buyer over independent items. The principal can offer an arbitrary menu of product bundles, but faces competition from smaller and more agile single-item…

Computer Science and Game Theory · Computer Science 2024-06-21 Moshe Babaioff , Linda Cai , Brendan Lucier

A recent line of research has established a novel desideratum for designing approximately-revenue-optimal multi-item mechanisms, namely the buy-many constraint. Under this constraint, prices for different allocations made by the mechanism…

Computer Science and Game Theory · Computer Science 2024-05-17 Shuchi Chawla , Rojin Rezvan , Yifeng Teng , Christos Tzamos

In many shopping scenarios, e.g., in online shopping, customers have a large menu of options to choose from. However, most of the buyers do not browse all the options and make decision after considering only a small part of the menu. To…

Computer Science and Game Theory · Computer Science 2018-02-15 Nick Gravin , Zhihao Gavin Tang

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

This paper studies optimal bundling of products with non-additive values. Under monotonic preferences and single-peaked profits, I show a monopolist finds pure bundling optimal if and only if the optimal sales volume for the grand bundle is…

General Economics · Economics 2022-04-22 Soheil Ghili

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 consider a monopolist seller facing a single buyer with additive valuations over n heterogeneous, independent items. It is known that in this important setting optimal mechanisms may require randomization [HR12], use menus of infinite…

Computer Science and Game Theory · Computer Science 2015-11-17 Aviad Rubinstein

Dynamic pricing schemes were introduced as an alternative to posted-price mechanisms. In contrast to static models, the dynamic setting allows to update the prices between buyer-arrivals based on the remaining sets of items and buyers, and…

Computer Science and Game Theory · Computer Science 2022-04-27 Kristóf Bérczi , Erika R. Bérczi-Kovács , Evelin Szögi

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
‹ Prev 1 2 3 10 Next ›