Online algorithms for market clearing

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 971-980

  Blum, Avrim ^a   Sandholm, Tuomas ^a   Zinkevich, Martin ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; SALES;

BUYERS AND SELLERS; COMPETITIVE RATIO; GREEDY ALGORITHMS; NUMBER OF TRADES; OFF-LINE ALGORITHM; ON-LINE ALGORITHMS; ON-LINE MATCHING; SIMPLER ALGORITHMS;

ELECTRONIC TRADING;

EID: 35048843054     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Banich Awerbuch, Yair Bartal, and Amos Fiat. Distributed paging for general networks. In Proc. 7th Sump, on Discrete Algorithms, pages 574-583, 1996.
2. A. Bagchi, A. Chaudhary, R. Garg, M. Goodrich, and V. Kumar. Seller-focused algorithms for online auctioning. In Proceedings of WADS 2001, pages 135-147, 2001.
3. C. Berge. Two theorems in graph theory. In Proceedings of the National Academy of Sciences, volume 43, pages 842-844, 1957.
4. A. Blum and C. Burch. On-line learning and the metrical task system problem. Machine Learning, 39(1):35-58, April 2000.
5. Allan Borodin and Ran El-Yarn v. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
6. Ian Domowitz. Automating the continuous double auction in practice: Automated trade execution systems in financial markets. In Daniel Friedman and John Rust, editors, The Double Auction Market, volume 14 of Santa Fe Institute Studies in the Sciences of Complexity, pages 27-60. Addison-Wesley, 1993.
7. Ran El-Yaniv, Amos Fiat, Richard M. Karp, and G. Turpin. Competitive analysis of financial games. In Proc. 33rd Symp. Foundations of Computer Science, pages 327-333, 1992.
8. Yoav Freund and Robert Schapire. Game theory, online prediction and boosting. In Proc. 9th Conf. on Computational Learning Theory, pages 325-332, 1996.
9. Andrew Goldberg, J Hartline, and A Wright. Competitive auctions and multiple digital goods. Technical report, InterTrust 00-01, 2000.
10. Andrew Goldberg, J Hartline, and A Wright. Competitive auctions and digital goods. In Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Washington, DC, 2001.
11. S. Goldman, J. Parwatikar, and S. Suri. On-fine scheduling with hard deadlines. Journal of Algorithms, 34:370-389, 2000.
12. Ming-Yang Kao and Stephen R. Tate. On-line difference maximization. SIAM Journal of Discrete Mathematics, 12(1):78-90, 1999.
13. Richard M. Karp, U. V. Vazirani, and V. V. Vazirani. An optimal algorithm for on-line bipartite matching. In Proc. 22nd Symp. Theory of Computing, pages 352-358, Baltimore, Maryland, 1990.
14. D. Kozen. The Design and Analysis of Algorithms. Springer-Verlag, New York, 1991.
15. Ron Lavi and Noam Nisan. Competitive analysis of incentive compatible on-line auctions. In Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), pages 233-241, Minneapolis, MN, 2000.
16. R. J. Lipton and A. Tomkins. Online interval scheduling. In Proc. 5th Symp. on Discrete Algorithms, pages 302-311, 1994.
17. N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108:212-261, 1994.
18. Tuomas Sandhohn. eMediator: A next generation electronic commerce server. In Proceedings of the Fourth International Conference on Autonomous Agents (AGENTS), pages 73-96, Barcelona, Spain, June 2000. Early version appeared in the AAAI-99 Workshop on AI in Electronic Commerce, Orlando, FL, pp. 46-55, July 1999, and as a Washington University, St. Louis, Dept. of Computer Science technical report WU-CS-99-02, Jan. 1999.
19. Tuomas Sandholm and Subhash Suri. Improved algorithms for optimal winner determination in combinatorial auctions and generalizations. In Proceedings of the National Conference on Artificial Intelligence (AAAI), pages 90-97, Austin, TX, 2000.
20. Tuomas Sandhohn and Subhash Suri. Market clear-ability. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJ-CAI), pages 1145-1151, Seattle, WA, 2001.
21. Tuomas Sandhohn, Subhash Suri, Andrew Gilpin, and David Levine. CABOB: A fast optimal algorithm for combinatorial auctions. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI), pages 1102-1108, Seattle, WA, 2001.
22. Peter R Wurman, Michael P Wellman, and William E Walsh. The Michigan Internet AuctionBot: A configurable auction server for human and software agents. In Proceedings of the Second International Conference on Autonomous Agents (AGENTS), pages 301-308, Minneapolis/St. Paul, MN, May 1998.