We consider profit maximization pricing problems, where we are given a set of m customers
and a set of n items. Each customer c is associated with a subset S c⊆ n of items of interest …

In the highway problem, we are given an n-edge path graph (the highway), and a set of
paths (the drivers), each one with its own budget. For a given assignment of edge weights …

In this paper, we study the revenue maximization envy-free pricing in multi-item markets:
there are m items and n potential buyers where each buyer is interested in acquiring one …

We consider markets consisting of a set of indivisible items, and buyers that have sharp multi-
unit demand. This means that each buyer ii wants a specific number d_i di of items; a bundle …

An instance of the tollbooth problem consists of an undirected network and a collection of
single-minded customers, each of which is interested in purchasing a fixed path subject to …

In Stackelberg pricing a leader sets prices for items to maximize revenue from a follower
purchasing a feasible subset of items. We consider computationally bounded followers who …

We investigate nonparametric multiproduct pricing problems, in which we want to find
revenue maximizing prices for products P based on a set of customer samples C. We mostly …

Tariff design is among the most elementary decision problems to be solved in every public
transportation network. This article focuses on alternative zone‐based tariffs, which vary in …

We study the revenue guarantees and approximability of item pricing. Recent work shows
that with n heterogeneous items, item-pricing guarantees an O (log n) approximation to the …

In this article, we study revenue maximizing envy-free pricing in multi-item markets: There
are m indivisible items with unit supply each and n potential buyers where each buyer is …