English
Related papers

Related papers: A Constructive Characterization of Optimal Bundlin…

200 papers

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 optimal pricing strategies of a monopolist selling a divisible good (service) to consumers that are embedded in a social network. A key feature of our model is that consumers experience a (positive) local network effect. In…

Computer Science and Game Theory · Computer Science 2011-01-31 Ozan Candogan , Kostas Bimpikis , Asuman Ozdaglar

We study revenue maximization by deterministic mechanisms for the simplest case for which Myerson's characterization does not hold: a single seller selling two items, with independently distributed values, to a single additive buyer. We…

Computer Science and Game Theory · Computer Science 2018-04-20 Moshe Babaioff , Noam Nisan , Aviad Rubinstein

We consider the well known, and notoriously difficult, problem of a single revenue-maximizing seller selling two or more heterogeneous goods to a single buyer whose private values for the goods are drawn from a (possibly correlated) known…

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

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

Bundling, the practice of jointly selling two or more products at a discount, is a widely used strategy in industry and a well examined concept in academia. Historically, the focus has been on theoretical studies in the context of…

Machine Learning · Computer Science 2020-02-04 Madhav Kumar , Dean Eckles , Sinan Aral

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

A monopolist offers personalized prices to consumers with unit demand, heterogeneous values, and idiosyncratic costs, who differ in a protected characteristic, such as race or gender. The seller is subject to a non-discrimination…

Theoretical Economics · Economics 2025-06-27 Philipp Strack , Kai Hao Yang

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

We study robustly optimal mechanisms for selling multiple items. The seller maximizes revenue against a worst-case distribution of a buyer's valuations within a set of distributions, called an "ambiguity" set. We identify the exact forms of…

Theoretical Economics · Economics 2024-08-26 Yeon-Koo Che , Weijie Zhong

Consider a monopolist selling $n$ items to an additive buyer whose item values are drawn from independent distributions $F_1,F_2,\ldots,F_n$ possibly having unbounded support. Unlike in the single-item case, it is well known that the…

Computer Science and Game Theory · Computer Science 2021-04-13 Moshe Babaioff , Yannai A. Gonczarowski , Noam Nisan

Multi-item mechanisms can be very complex offering many different bundles to the buyer that could even be randomized. Such complexity is thought to be necessary as the revenue gaps between randomized and deterministic mechanisms, or…

Computer Science and Game Theory · Computer Science 2019-07-03 Shuchi Chawla , Yifeng Teng , Christos Tzamos

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

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 an economic environment with one buyer and one seller. For a bundle $(t,q)\in [0,\infty[\times [0,1]=\mathbb{Z}$, $q$ refers to the winning probability of an object, and $t$ denotes the payment that the buyer makes. We consider…

Computer Science and Game Theory · Computer Science 2024-12-17 Mridu Prabal Goswami

Retailers have significant potential to improve recommendations through strategic bundling and pricing. By taking into account different types of customers and their purchasing decisions, retailers can better accommodate customer…

Optimization and Control · Mathematics 2024-09-06 Maxime Bouscary , Mazen Danaf , Saurabh Amin

We study a robust selling problem where a seller attempts to sell one item to a buyer but is uncertain about the buyer's valuation distribution. Existing literature shows that robust screening provides a stronger theoretical guarantee than…

Theoretical Economics · Economics 2024-09-27 Shixin Wang

We study the problem of modeling purchase of multiple products and utilizing it to display optimized recommendations for online retailers and e-commerce platforms. We present a parsimonious multi-purchase family of choice models called the…

Information Retrieval · Computer Science 2023-08-08 Theja Tulabandhula , Deeksha Sinha , Saketh Reddy Karra , Prasoon Patidar

We study the multi-item mechanism design problem where a monopolist sells $n$ heterogeneous items to a single buyer. We focus on buy-many mechanisms, a natural class of mechanisms frequently used in practice. The buy-many property allows…

Computer Science and Game Theory · Computer Science 2020-03-25 Shuchi Chawla , Yifeng Teng , Christos Tzamos

A monopolist sells multiple goods to an uninformed buyer. The buyer chooses to learn any one-dimensional linear signal of their values for the goods, anticipating the seller's mechanism. The seller designs an optimal mechanism, anticipating…

Theoretical Economics · Economics 2025-09-23 Agathe Pernoud , Frank Yang