On capital investment

Algorithmica (New York)

Volumn 25, Issue 1, 1999, Pages 22-36

  Azar, Y ^a,b   Bartal, Y ^c   Feuerstein, E ^d,e   Fiat, A ^a,b   Leonardi, S ^f   Rosen A ^g  

^a TEL AVIV UNIVERSITY   (Israel)

^b Israel Academy of Sciences   (Israel)

^c INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^d UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^e INSTITUTO DE CIENCIAS   (Argentina)

^f SAPIENZA UNIVERSITY OF ROME   (Italy)

^g UNIVERSITY OF TORONTO   (Canada)

Author keywords

Competitive ratio; On line algorithms; On line financial problems

Indexed keywords

EID: 0013139684     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009281     Document Type: Article

References (6)

1. A. Chou, J. Cooperstock, R. El-Yaniv, M. Klugerman, and F. Leighton. The Statistical Adversary Allows Optimal Money-Making Trading Strategies. In Proc. 6th Annual ACM/SIAM Symposium on Discrete Algorithms, pp. 467-476, 1995.
2. R. El-Yaniv, A. Fiat, R. Karp, and G. Turpin. Competitive Analysis of Financial Games. In Proc. 33rd IEEE Annual Symposium on Foundations of Computer Science, pp. 327-333, 1992.
3. R. El-Yaniv and R. M. Karp. The Mortgage Problem. In Proc. 2nd Israeli Symposium on Theory of Computing and Systems, pp. 304-312, June 1993.
4. R. M. Karp, On-Line Algorithms Versus Off-Line Algorithms: How Much Is It Worth to Know the Future? In Proc. IFIP 12th World Computer Congress. Volume 1: Algorithms, Software, Architecture, pp. 416-429. Elsevier, Amsterdam.
5. P. Raghavan. A Statistical Adversary for On-Line Algorithms. In On-Line Algorithms, pp. 79-83. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 7. American Mathematical Society, Providence, RI/Association for Computing Machinery, New York, 1991.
6. D. D. Sleator and R. E. Tarjan. Amortized Efficiency of List Update and Paging Rules. Communications of the ACM. 28:202-208, February 1985.