Skip to main content
Article thumbnail
Location of Repository

Near-Optimal Pricing in Near-Linear Time

By Jason D. Hartline and Vladlen Koltun

Abstract

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 [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.

Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.9469
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://vw.stanford.edu/~vladle... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.