A Risk-Reward Competitive Analysis of the Bahncard Problem
暂无分享,去创建一个
[1] Ran El-Yaniv,et al. Competitive Optimal On-Line Leasing , 1999, Algorithmica.
[2] Yoram Singer,et al. On‐Line Portfolio Selection Using Multiplicative Updates , 1998, ICML.
[3] Sabah al-Binali,et al. A Risk‐Reward Framework for the Competitive Analysis of Financial Games , 1999, Algorithmica.
[4] Ran El-Yaniv,et al. Competitive solutions for online financial problems , 1998, CSUR.
[5] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[6] Ran El-Yaniv,et al. The statistical adversary allows optimal money-making trading strategies , 1995, SODA '95.
[7] Prabhakar Raghavan,et al. A Statistical Adversary for On-line Algorithms , 1991, On-Line Algorithms.
[8] Claire Mathieu,et al. Dynamic TCP acknowledgement and other stories about e/(e-1) , 2001, STOC '01.
[9] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[10] Rudolf Fleischer. On the Bahncard problem , 2001, Theor. Comput. Sci..