English
Related papers

Related papers: A Characterization for Optimal Bundling of Product…

200 papers

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

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

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

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

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

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

We study the problem of characterizing revenue optimal auctions for single-minded buyers. Each buyer is interested only in a specific bundle of items and has a value for the same. Both his bundle and its value are his private information.…

Computer Science and Game Theory · Computer Science 2010-09-14 Vineet Abhishek , Bruce Hajek

A retailer is purchasing goods in bundles from suppliers and then selling these goods in bundles to customers; her goal is to maximize profit, which is the revenue obtained from selling goods minus the cost of purchasing those goods. In…

Data Structures and Algorithms · Computer Science 2025-08-01 Yossi Azar , Niv Buchbinder , Roie Levin , Or Vardi

It is well-known that selling different goods in a single bundle can significantly increase revenue. However, bundling is no longer profitable if the goods have high production costs. To overcome this challenge, we introduce a new…

Computer Science and Game Theory · Computer Science 2021-02-23 Will Ma , David Simchi-Levi

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

Maximizing the revenue from selling _more than one_ good (or item) to a single buyer is a notoriously difficult problem, in stark contrast to the one-good case. For two goods, we show that simple "one-dimensional" mechanisms, such as…

Computer Science and Game Theory · Computer Science 2022-09-22 Sergiu Hart , Noam Nisan

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

A monopolist wishes to maximize her profits by finding an optimal price policy. After she announces a menu of products and prices, each agent $x$ will choose to buy that product $y(x)$ which maximizes his own utility, if positive. The…

Optimization and Control · Mathematics 2021-02-12 Robert J. McCann , Kelvin Shuangjian Zhang

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

We consider a robust version of the revenue maximization problem, where a single seller wishes to sell $n$ items to a single unit-demand buyer. In this robust version, the seller knows the buyer's marginal value distribution for each item…

Computer Science and Game Theory · Computer Science 2020-08-27 Moshe Babaioff , Michal Feldman , Yannai A. Gonczarowski , Brendan Lucier , Inbal Talgam-Cohen

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