Abstract
This paper investigated a new framework for the competitive analysis of the Bahncard problem. In contrast to the earlier approach we introduce the interest rate i and the risk tolerance t into the model, in which the traveller can develop the optimal trading strategies based on his risk preference. Set \(\alpha=\frac{1}{1+i}\). We prove that the Bahncard problem with the interest rate is \(1+(1-\beta)\alpha^{{m^*}+1}\,\)-competitive, where m * is the critical point. Then we further design a t-tolerance strategy and present a surprisingly flexible competitive ratio of \(1+\frac{(1-\beta)\alpha^{m^*}}{tr^*-(1-\beta\alpha^{m^*})}\) , where r * is the optimal competitive ratio for the Bahncard problem with the interest rate and β is the percentage of discount.
This research is supported by NSF of China under Grants 10371094 and 70471035.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
al-Binali, B.: A risk-reward framework for the competitive analysis of financial games. Algorithmica 25, 99–115 (1999)
Fleischer, R.: On the Bahncard problem. In: Hsu, W.-L., Kao, M.-Y. (eds.) COCOON 1998. LNCS, vol. 1449, pp. 65–74. Springer, Heidelberg (1998)
Raghavan, P.: A Statistical Aderverary for on-line Algorithms. DIMACS Series in Discrete Mathematics 7, 79–83 (1992)
Helmbold, D.P., Schapire, R.E., Singer, Y., Warmuth, M.K.: Online Portfolio Selection Using Multiplicative Updates. Mathematical Finance 8, 325–347 (1998)
Borodin, A., EI-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, London (1998)
El-Yaniv, R., Kaniel, R., Linial, N.: Competitive Optimal On-line Leasing. Algorithmica 25, 116–140 (1999)
Karlin, A.R., Kenyon, C., Randall, D.: Dynamic TCP Acknowledgement and Other Stories about e/(e − 1). In: Proc. STOC 2001, vol. 25, pp. 502–509 (2001)
El-Yaniv, R.: Competitive Solution for online Financial Problem. ACM Computing Surveys 25(1), 28–70 (1998)
Sleator, D.D., Tarjan, R.E.: Amortized Efficiency of List Update and Paging Rules. Communication of the ACM 28, 202–208 (1985)
Chou, A., Cooperstock, R., El-Yaniv, R., Klugerman, M., Leighton, T.: The statistical adversary allows optimal money-making trading strategies. In: The Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ding, L., Xu, Y., Hu, S. (2005). The Bahncard Problem with Interest Rate and Risk. In: Deng, X., Ye, Y. (eds) Internet and Network Economics. WINE 2005. Lecture Notes in Computer Science, vol 3828. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11600930_30
Download citation
DOI: https://doi.org/10.1007/11600930_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30900-0
Online ISBN: 978-3-540-32293-1
eBook Packages: Computer ScienceComputer Science (R0)