Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive solutions for online financial problems
ACM Computing Surveys (CSUR)
Online computation and competitive analysis
Online computation and competitive analysis
The statistical adversary allows optimal money-making trading strategies
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Dynamic TCP acknowledgement and other stories about e/(e-1)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Competitive analysis of two special online device replacement problems
Journal of Computer Science and Technology
New results on online replacement problem
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Hi-index | 0.00 |
Competitive analysis for all investors in the Bahncard problem (a railway pass of the Deutsche Bundesbahn company) has received much attention in recent years. In contrast to this common approach, which selects the riskless outcome and achieves the optimal competitive ratio, this paper introduces a risk-reward competitive strategy to achieve flexibility. Namely, we extend the traditional competitive analysis to provide a framework in which the travellers can develop optimal trading strategies based on their risk tolerance and investing capability. We further present a surprisingly flexible competitive ratio of $r^*_A = 1 + \frac{1-\beta}{(2-\beta)t - (1-\beta)}$ for the Bahncard problem, where t is the risk tolerance and β is the percentage of discount with respect to this strategy. Then substituting t = 1 into the above equation, we obtain the (2 – β)–competitive ratio which is the best attainable result presented by Fleischer.