Near-Optimal Pricing in Near-Linear Time

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 [3]. In light of the fact that the problems we address are APX-hard in general [5], we design near-linear and near-cubic time approximation schemes under the assumption that the number of distinct items for sale is constant.

• Type: Conference
• Year: 2005
• Where: WADS
• Authors: Jason D. Hartline, Vladlen Koltun
• Keywords: Algorithms, Efficient Approximation Algorithms, Related Pricing Mechanisms, Time Approximation Schemes, WADS 2005