@inproceedings{hartline2005near-optimal,
author = {Hartline, Jason D. and Koltun, Vladlen},
title = {Near-Optimal Pricing in Near-Linear Time},
series = {Lecture Notes in Computer Science},
booktitle = {9th International Workshop Algorithms and Data Structures (WADS 2005)},
year = {2005},
month = {August},
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.},
publisher = {Springer},
url = {http://approjects.co.za/?big=en-us/research/publication/near-optimal-pricing-in-near-linear-time/},
pages = {422-431},
volume = {3608},
edition = {9th International Workshop Algorithms and Data Structures (WADS 2005)},
}