Optimal search and one-way trading online algorithms

Algorithmica (New York)

Volumn 30, Issue 1, 2001, Pages 101-139

  El Yaniv, R ^a   Fiat, A ^b   Karp, R M ^c,d   Turpin, G ^e  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

^c INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

^e UNIVERSITY OF TORONTO   (Canada)

Author keywords

Competitive analysis; One way trading; Online algorithms; Portfolio selection; Time series search; Two way trading

Indexed keywords

ALGORITHMS; GAME THEORY; ONLINE SYSTEMS; PROBABILITY DISTRIBUTIONS; TIME SERIES ANALYSIS;

CONVERSION RATE;

OPTIMAL SYSTEMS;

EID: 0009052751     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0003-0     Document Type: Article

References (30)

1. M. Ajtai, N. Megiddo, and O. Waarts. Improved algorithms and analysis for secretary problems and generalizations. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pages 473-482, 1995.
2. S. al-Binali. The competitive analysis of risk raking with application to online trading. In Prodeedings of the 38th Annual Symposium on Foundations of Computer Science, pages 336-344, 1997.
3. R.J. Aumann. Mixed and behavior strategies in infinite extensive games. In M. Dresher, L.S. Shapley, and A.W. Tucker, editors. Advances in Game Theory, volume 1, pages 627-650. Princeton University Press, Princeton, New Jersey, 1964.
4. R.E. Bellman and S.E. Dreyfus. Applied Dynamic Programming. Cambridge University Press, Princeton, New Jersey, 1962.
5. S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Widgerson. On the power of randomization in on-line algorithms. In Proceedings of the 22nd Symposium on Theory of Algorithms, pages 379-386, 1990.
6. A. Blum and A. Kalai. Universal portfolios with and without transaction costs. In Proceedings of the Tenth Annual Conference on Computational Learning Theory, pages 309-313, 1997.
7. A. Borodin, N. Linial, and M. Saks. An optimal online algorithm for metrical task systems. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 373-382, 1987. For the journal version see [8].
8. A. Borodin, N. Linial, and M. Saks. An optimal online algorithm for metrical task systems. Journal of the ACM, 39:745-763, 1992. For the conference version see [7].
9. A. Chou, J. Cooperstock, R. El-Yaniv, M. Klugerman, and T. Leighton. The statistical adversary allows optimal money-making trading strategies. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 1995.
10. A. Chou, A. Shrivastava, and R. Sidney. On the power of magnitude. Unpublished manuscript, May 1995.
11. Y.S. Chow, H. Robbins, and D. Siegmund. The Theory of Optimal Stopping. Dover, New York, 1971.
12. A. Condon. Computational Models of Games. The MIT Press, Cambridge, Massachusetts, 1988.
13. T.M. Cover and E. Ordentlich. Universal portfolios with side information. IEEE Transactions on Information Theory, 42(2), March 1996.
14. A. Fiat, R.M. Karp, M. Luby, L.A. McGeoch, D.D. Sleator, and N.E. Young. Competitive Paging Algorithms. Technical Report CMU-CS-88-196, Carnegie Mellon University, Pittsburg, Pennsylvania, 1988. For the journal version see [15].
15. A. Fiat, R.M. Karp, M. Luby, L.A. McGeoch, D.D. Sleator, and N.E. Young. Competitive paging algorithms. Journal of Algorithms, 12:685-699, 1991. For the technical report version see [14].
16. P.R. Freeman. The secretary problem and its extensions. International Statistical Review, 51:189-206, 1983.
17. R.L. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal, 45:1563-1581, 1966.
18. D.P. Helmbold, R.E. Schapire, Y. Singer, and M.K. Warmuth. On-line portfolio selection using multiplicative updates. Unpublished manuscript, April 1996.
19. D.S. Johnson. Near-Optimal Bin Packing Algorithms. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1973.
20. D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham. Worst-case performance bounds for simple one-dimensional packing algorithms. 3:299-324, 1974.
21. A.R. Karlin, L. Rudolph, and D.D. Sleator. Competitive snoopy caching. 3(1):70-119, 1988.
22. L. Levin. Personal communication, July 1994.
23. S.A. Lippman and J.J. McCall. The economics of job search: a survey. Economic Inqury, XIV: 155-189, June 1976.
24. S.A. Lippman and J.J. McCall. The economics of uncertainty: selected topics and probabilistic methods. In K.J. Arrow and M.D. Intriligator, editors, Handbook of Mathematical Economics, volume 1, chapter 6, pages 211-284. North-Holland, Amsterdam, 1981.
25. E. Ordentlich and T.M. Cover. The cost of achieving the best porfolio in hindsight. Mathematics of Operations Research, 23(4):960-982, November 1998.
26. C.H. Papadimitriou. Games against nature. In Proceedings of the 24th Annual Symposium on Foundations of Computer Science, pages 446-450, 1983.
27. P. Raghavan. A statistical adversary for on-line algorithms. In L.A. McGeoch and D.D. Sleator, editors, On-Line Algorithms, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 7, pages 79-83. American Mathematical Society, Providence, RI, 1992.
28. D.B. Rosenfield and R.D. Shapiro. Optimal adaptive price search. Journal of Economic Theory, 25(1): 1-20, 1981.
29. D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202-208, 1985.
30. A.C. Yao. New algorithms for bin packing. Journal of the ACM, 27:207-227, 1980.