English
Related papers

Related papers: Selling Multiple Complements with Packaging Costs

200 papers

Motivated by the problem of selling large, proprietary data, we consider an information pricing problem proposed by Bergemann et al. that involves a decision-making buyer and a monopolistic seller. The seller has access to the underlying…

Computer Science and Game Theory · Computer Science 2026-03-26 Andrew Li , R. Ravi , Karan Singh , Zihong Yi , Weizhong Zhang

We study how to optimally segment monopolistic markets with a redistributive objective. We characterize optimal redistributive segmentations and show that they (i) induce the seller to price progressively, i.e., charge richer consumers…

Theoretical Economics · Economics 2026-05-14 Victor Augias , Alexis Ghersengorin , Daniel M. A. Barreto

The problem of designing a profit-maximizing, Bayesian incentive compatible and individually rational mechanism with flexible consumers and costly heterogeneous supply is considered. In our setup, each consumer is associated with a…

Computer Science and Game Theory · Computer Science 2018-02-01 Shiva Navabi , Ashutosh Nayyar

Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…

Data Structures and Algorithms · Computer Science 2026-05-05 Samuel Boardman

In this paper, we propose an equilibrium pricing model in a dynamic multi-period stochastic framework with uncertain income streams. In an incomplete market, there exist two traded risky assets (e.g. stock/commodity and weather derivative)…

Optimization and Control · Mathematics 2012-05-29 Traian A. Pirvu , Huayue Zhang

Matching markets are of particular interest in computer science and economics literature as they are often used to model real-world phenomena where we aim to equitably distribute a limited amount of resources to multiple agents and…

Computer Science and Game Theory · Computer Science 2021-10-01 Andrew Yang , Bruce Changlong Xu , Ivan Villa-Renteria

Two general algorithms based on opportunity costs are given for approximating a revenue-maximizing set of bids an auctioneer should accept, in a combinatorial auction in which each bidder offers a price for some subset of the available…

Computational Engineering, Finance, and Science · Computer Science 2007-05-23 Karhan Akcoglu , James Aspnes , Bhaskar DasGupta , Ming-Yang Kao

The problem of market clearing is to set a price for an item such that quantity demanded equals quantity supplied. In this work, we cast the problem of predicting clearing prices into a learning framework and use the resulting models to…

Machine Learning · Computer Science 2019-06-25 Weiran Shen , Sébastien Lahaie , Renato Paes Leme

We study the power of price discrimination via an intermediary in bilateral trade, when there is a revenue-maximizing seller selling an item to a buyer with a private value drawn from a prior. Between the seller and the buyer, there is an…

Computer Science and Game Theory · Computer Science 2023-04-28 Shao-Heng Ko , Kamesh Munagala

We consider a discrete time financial market with proportional transaction costs under model uncertainty, and study a num\'eraire-based semi-static utility maximization problem with an exponential utility preference. The randomization…

Mathematical Finance · Quantitative Finance 2019-08-02 Shuoqing Deng , Xiaolu Tan , Xiang Yu

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

In approval-based multiwinner voting, voters express approval preferences over a set of candidates, and the goal is to return a winning committee. This model captures a broad range of subset selection problems under preferences. Prior work…

Computer Science and Game Theory · Computer Science 2026-04-28 Niclas Boehmer , Luca Kreisel , Jannik Peters

We resolve the complexity of revenue-optimal deterministic auctions in the unit-demand single-buyer Bayesian setting, i.e., the optimal item pricing problem, when the buyer's values for the items are independent. We show that the problem of…

Computer Science and Game Theory · Computer Science 2017-02-24 Xi Chen , Ilias Diakonikolas , Dimitris Paparas , Xiaorui Sun , Mihalis Yannakakis

Combining two or more items and selling them as one good, a practice called bundling, can be a very effective strategy for reducing the costs of producing, marketing, and selling goods. In this paper, we consider a form of multi-issue…

Multiagent Systems · Computer Science 2007-05-23 Koye Somefun , Tomas Klos , Han La Poutré

A public decision-making problem consists of a set of issues, each with multiple possible alternatives, and a set of competing agents, each with a preferred alternative for each issue. We study adaptations of market economies to this…

Computer Science and Game Theory · Computer Science 2019-07-23 Nikhil Garg , Ashish Goel , Benjamin Plaut

We study the computational complexity of finding fair allocations of indivisible goods in the setting where a social network on the agents is given. Notions of fairness in this context are "localized", that is, agents are only concerned…

Computer Science and Game Theory · Computer Science 2021-11-24 Neeldhara Misra , Debanuj Nayak

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

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

This paper studies an open question in the warehouse problem where a merchant trading a commodity tries to find an optimal inventory-trading policy to decide on purchase and sale quantities during a fixed time horizon in order to maximize…

Data Structures and Algorithms · Computer Science 2023-02-24 Ishan Bansal , Oktay Günlük

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