Algorithmic pricing is the computational problem that sellers (eg, in supermarkets) face when
trying to set prices for their items to maximize their profit in the presence of a known demand …

We provide a computationally efficient black-box reduction from mechanism design to
algorithm design in very general settings. Specifically, we give an approximation-preserving …

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 efficiently solve the optimal multi-dimensional mechanism design problem for
independent additive bidders with arbitrary demands when either the number of bidders is …

We consider the unit-demand min-buying pricing problem, in which we want to compute
revenue maximizing prices for a set of products P assuming that each consumer from a set …

We provide a Polynomial Time Approximation Scheme for the multi-dimensional unit-
demand pricing problem, when the buyer's values are independent (but not necessarily …

We study a multi-player one-round game termed Stackelberg Network Pricing Game, in
which a leader can set prices for a subset of m priceable edges in a graph. The other edges …

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 …

One of the main concerns in management and economic planning is to sell the right product
to the right customer for the right price. Companies in retail and manufacturing employ …

We study the envy-free pricing problem faced by a profit maximizing seller when there is
metric substitutability among the items---consumer i's value for item j is vi--ci, j, and the …