Abstract
In this paper we provide an algorithmic approach to the study of online auctioning. From the perspective of the seller we formalize the auctioning problem as that of designing an algorithmic strategy that fairly maximizes the revenue earned by selling n identical items to bidders who submit bids online. We give a randomized online algorithm that is O(logB)-competitive against an oblivious adversary, where the bid values vary between 1 and B per item. We show that this algorithm is optimal in the worst-case and that it performs significantly better than any worst-case bounds achievable via deterministic strategies. Additionally we present experimental evidence to show that our algorithm outperforms conventional heuristic methods in practice. And finally we explore ways of modifying the conventional model of online algorithms to improve competitiveness of other types of auctioning scenarios while still maintaining fairness.
A significant portion of this work was done while this author was at IBM’s India Research Lab.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Adler and Y. Azar. Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1–10, 1999.
B. Awerbuch and Y. Azar. Blindly competitive algorithms for pricing and bidding. Manuscript.
B. Awerbuch, Y Azar, and S. Plotkin. Throughput competitive on-line routing. In Proceedings of the 34th Annual Symposium on Foundations of Computer Science, pages 32–40. IEEE, 3–5 November 1993.
B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosen. Competitive non-preemptive call-control. In Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 23–25 Jan 1994.
A. Bagchi, A. Chaudhary, R. Garg, M. T. Goodrich, and V. Kumar. Online algorithms for auctioning problems. Technical report, IBM India Research Lab, 2000.
S. Ben-David and A. Borodin. A new measure for the study of on-line algorithms. Algorithmica, 11:73–91, 1994.
A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
D. Dooly, S. Goldman, and S. Scott. Tcp dynamic acknowledgment delay: Theory and practice. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing,, pages 289–298, May 1998.
R. Engelbrecht-Wiggans, M. Shubik, and R. M. Stark, editors. Auctions, Bidding, and Contracting: Uses and Theory. New York University Press, 1983.
E. F. Grove. Online bin packing with lookahead. In Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 430–436, 1995.
Dorit S. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston, MA., 1997.
O. H. Ibarra and C. E. Kim. Fast approximation algorithms for the knapsack and subset sum problems. Journal of the ACM, 22:463–468, 1975.
E. L. Lawler. Fast approximation algorithms for knapsack problems. In Proceedings of the 17th Annual Symposium on Foundations of Computer Science, pages 206–213, 1977.
S. Leonardi and A. Marchetti-Spaccamela. On-line resource management with applications to routing and scheduling. In Proceedings of the 22nd International Colloquium on Automata, Languages and Programming, pages 303–314, 1995.
R. J. Lipton and A. Tomkins. Online interval scheduling. In Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 302–11, 23–25 Jan 1994.
G. Lueker. Average-case analysis of off-line and on-line knapsack problems. Journal of Algorithms, 29(2):277–305, November 1998.
A. Marchetti-Spaccamela and C. Vercellis. Stochastic on-line knapsack problems. Mathematical Programming, 68(1):73–104, Jan 1995.
R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
M. H. Rothkopf, A Pekec, and R. M. Harstad. Computationally manageable combinatorial auctions. Management Science, 44(8):1131–1147, 1998.
S. Sahni. Approximation algorithms for the 0/1 knapsack problem. Journal of the ACM, 22:115–124, 1975.
T. Sandholm. An algorithm for optimal winner determination in combinational auctions. Technical Report WUCS-99-01, Department of Computer Science, Washington University, January 1999.
Charles W. Smith. Auctions: The Social Construction of Value. The Free Press, 1989.
P. R. Wurman, M. P. Wellman, and W. E. Walsh. A parametrization of the auction design space. Games and Economic Behaviour, To appear.
A. C-C. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proceedings of the 17th Annual Symposium on Foundations of Computer Science, pages 222–227, 1977.
T. Yeh, C. Kuo, C. Lei, and H. Yen. Competitive analysis of on-line disk scheduling. Theory of Computing Systems, 31:491–506, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bagchi, A., Chaudhary, A., Garg, R., Goodrich, M.T., Kumar, V. (2001). Seller-Focused Algorithms for Online Auctioning. In: Dehne, F., Sack, JR., Tamassia, R. (eds) Algorithms and Data Structures. WADS 2001. Lecture Notes in Computer Science, vol 2125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44634-6_13
Download citation
DOI: https://doi.org/10.1007/3-540-44634-6_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42423-9
Online ISBN: 978-3-540-44634-7
eBook Packages: Springer Book Archive