A risk-reward competitive analysis of the bahncard problem

Lecture Notes in Computer Science

Volumn 3521, Issue , 2005, Pages 37-45

  Ding, Lili ^a   Xin, Chunlin ^a   Chen, Jian ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; STRATEGIC PLANNING;

BAHNCARD PROBLEMS; RISK-REWARD COMPETITIVE ANALYSIS;

RISK MANAGEMENT;

EID: 25144435828     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496199_6     Document Type: Conference Paper

References (10)

1. B.al-Binali. A risk-reward framework for the competitive analysis of financial games. Algorithmica, 25: 99-115, 1999.
2. R.Fleischer. On the Bahncard problem. COCOON'98, LNCS 1449, 65-74, 1998.
3. P.Raghavan. A Statistical Adversary for on-line Algorithms. DIMACS Series in Discrete Mathematics, 7 : 79-83,1992.
4. D.P.Helmbold, R.E.Schapire, Y.Singer and M.K.Warmuth .Online Portfolio Selection Using Multiplicative Updates. Mathematical Finance, 8 : 325-347,1998.
5. Borodin, R. EI-Yaniv. Online Computation and Competitive Analysis, Cambridge University Press, London, U.K.,1998.
6. R.El-Yaniv, Kaniel and N.Linial. Competitive Optimal On-line Leasing.Algorithmica, 25: 116-140,1999.
7. A. R. Karlin, C. Kenyon and D. Randall. Dynamic TCP Acknowledgement and Other Stories about e/(e - 1), Proc. STOC '01, 25: 502-509,2001.
8. R.El-Yaniv. Competitive Solution for online Financial Problem. ACM Computing Surveys, 25(1): 28-70,1998.
9. D.D. Sleator, R.E.Tarjan. Amortized Efficiency of List Update and Paging Rules. Communication of the ACM, 28,202-208,1985.
10. A.Chou, R.CooperstockJ, R.El-Yaniv, M.Klugerman and T.Leighton. The statistical adversary allows optimal money-making trading strategies. In the Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms,1995.