We consider the problem of pricing n items to maximize revenue when faced with a series of
unknown buyers with complex preferences, and show that a simple pricing scheme …

We present approximation and online algorithms for a number of problems of pricing items
for sale so as to maximize seller's revenue in an unlimited supply setting. Our first result is an …

We present the first polynomial-time approximation algorithms for single-minded envy-free
profit-maximization problems (Guruswami et al., 2005) with limited supply. Our algorithms …

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 the following item pricing problem which has received much attention recently.
A seller has an infinite numbers of copies of n items. There are m buyers, each with a budget …

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 …

In the tollbooth problem on trees, we are given a tree T=(V, E) with n edges, and a set of m
customers, each of whom is interested in purchasing a path on the graph. Each customer …