We give a. simple analysis of the competitive ratio of the random sampling auction from [10]. The random sampling auction was first shown to be worst-case competitive in [9] (with a bound of 7600 on its competitive ratio); our analysis improves the bound to, 15. In support of the conjecture that random sampling auction is in fact 4-competitive, we show that on the equal revenue input, where any sale price gives the same revenue, random sampling is exactly a factor of four from optimal. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Feige, U., Flaxman, A., Hartline, J. D., & Kleinberg, R. (2005). On the competitive ratio of the random sampling auction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3828 LNCS, pp. 878–886). https://doi.org/10.1007/11600930_89
Mendeley helps you to discover research relevant for your work.