Seller-Focused Algorithms for Online Auctioning-Reference-Cited by-同舟云学术

Seller-Focused Algorithms for Online Auctioning

Published:2001 Issue: Volume: Page:135-147
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bagchi Amitabha,Chaudhary Amitabh,Garg Rahul,Goodrich Michael T.,Kumar Vijay

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44634-6_13

Reference25 articles.

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 call-control. 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.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Online learning in online auctions;Theoretical Computer Science;2004-09

2. Dynamic Price Sequence and Incentive Compatibility;Automata, Languages and Programming;2004

3. Variable Quantity Market Clearing Algorithms;E-Business and Telecommunication Networks