Abstract. We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for such problems enable the design of auctions and related pricing mechanisms . In light of the fact that the problems we address are APX-hard in general , we design near-linear and near-cubic time approximation schemes under the assumption that the number of distinct items for sale is constant.
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.