Seller-focused algorithms for online auctioning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2125, Issue , 2001, Pages 135-147

  Bagchi, Amitabha ^a   Chaudhary, Amitabh ^a   Garg, Rahul ^b   Goodrich, Michael T ^a   Kumar, Vijay ^c  

^a Whiting School of Engineering   (United States)

^b IBM INDIA RESEARCH LAB   (India)

^c AMAZON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; ELECTRONIC COMMERCE; HEURISTIC METHODS;

ALGORITHMIC APPROACH; CONVENTIONAL MODELING; EXPERIMENTAL EVIDENCE; OBLIVIOUS ADVERSARIES; ON-LINE ALGORITHMS; ONLINE AUCTIONING;

ALGORITHMS;

EID: 35048830214     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44634-6_13     Document Type: Conference Paper

References (25)

1. 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.
2. B. Awerbuch and Y. Azar. Blindly competitive algorithms for pricing and bidding. Manuscript.
3. 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.
4. B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosen. Competitive non-preemptive callcontrol. In Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 23-25 Jan 1994.
5. A. Bagchi, A. Chaudhary, R. Garg, M. T. Goodrich, and V. Kumar. Online algorithms for auctioning problems. Technical report, IBM India Research Lab, 2000.
6. S. Ben-David and A. Borodin. A new measure for the study of on-line algorithms. Algorithmica, 11:73–91, 1994.
7. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
8. 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.
9. R. Engelbrecht-Wiggans, M. Shubik, and R. M. Stark, editors. Auctions, Bidding, and Contracting: Uses and Theory. New York University Press, 1983.
10. E. F. Grove. Online bin packing with lookahead. In Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 430–436, 1995.
11. Dorit S. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston, MA., 1997.
12. 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.
13. 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.
14. 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.
15. 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.
16. G. Lueker. Average-case analysis of off-line and on-line knapsack problems. Journal of Algorithms, 29(2):277–305, November 1998.
17. A. Marchetti-Spaccamela and C. Vercellis. Stochastic on-line knapsack problems. Mathematical Programming, 68(1):73–104, Jan 1995.
18. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
19. M. H. Rothkopf, A Pekec, and R. M. Harstad. Computationally manageable combinatorial auctions. Management Science, 44(8):1131–1147, 1998.
20. S. Sahni. Approximation algorithms for the 0/1 knapsack problem. Journal of the ACM, 22:115–124, 1975.
21. T. Sandholm. An algorithm for optimal winner determination in combinational auctions. Technical Report WUCS-99-01, Department of Computer Science,Washington University, January 1999.
22. Charles W. Smith. Auctions: The Social Construction of Value. The Free Press, 1989.
23. P. R. Wurman, M. P. Wellman, and W. E. Walsh. A parametrization of the auction design space. Games and Economic Behaviour, To appear.
24. 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.
25. T. Yeh, C. Kuo, C. Lei, and H. Yen. Competitive analysis of on-line disk scheduling. Theory of Computing Systems, 31:491–506, 1998.