{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:39Z","timestamp":1725558999133},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262244"},{"type":"electronic","value":"9783540324409"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496199_6","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T10:29:15Z","timestamp":1279103355000},"page":"37-45","source":"Crossref","is-referenced-by-count":8,"title":["A Risk-Reward Competitive Analysis of the Bahncard Problem"],"prefix":"10.1007","author":[{"given":"Lili","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunlin","family":"Xin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/PL00009285","volume":"25","author":"B. al-Binali","year":"1999","unstructured":"al-Binali, B.: A risk-reward framework for the competitive analysis of financial games. Algorithmica\u00a025, 99\u2013115 (1999)","journal-title":"Algorithmica"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-68535-9_10","volume-title":"Computing and Combinatorics","author":"R. Fleischer","year":"1998","unstructured":"Fleischer, R.: On the Bahncard problem. In: Hsu, W.-L., Kao, M.-Y. (eds.) COCOON 1998. LNCS, vol.\u00a01449, pp. 65\u201374. Springer, Heidelberg (1998)"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1090\/dimacs\/007\/05","volume":"7","author":"P. Raghavan","year":"1992","unstructured":"Raghavan, P.: A Statistical Adversary for on-line Algorithms. DIMACS Series in Discrete Mathematics\u00a07, 79\u201383 (1992)","journal-title":"DIMACS Series in Discrete Mathematics"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1111\/1467-9965.00058","volume":"8","author":"D.P. Helmbold","year":"1998","unstructured":"Helmbold, D.P., Schapire, R.E., Singer, Y., Warmuth, M.K.: Online Portfolio Selection Using Multiplicative Updates. Mathematical Finance\u00a08, 325\u2013347 (1998)","journal-title":"Mathematical Finance"},{"key":"6_CR5","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., EI-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, London (1998)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/PL00009279","volume":"25","author":"R. El-Yaniv","year":"1999","unstructured":"El-Yaniv, R., Kaniel, R., Linial, N.: Competitive Optimal On-line Leasing. Algorithmica\u00a025, 116\u2013140 (1999)","journal-title":"Algorithmica"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Karlin, A.R., Kenyon, C., Randall, D.: Dynamic TCP Acknowledgement and Other Stories about e\/(e\u2009\u2212\u20091). In: Proc. STOC 2001, vol.\u00a025, pp. 502\u2013509 (2001)","DOI":"10.1145\/380752.380845"},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/274440.274442","volume":"25","author":"R. El-Yaniv","year":"1998","unstructured":"El-Yaniv, R.: Competitive Solution for online Financial Problem. ACM Computing Surveys\u00a025(1), 28\u201370 (1998)","journal-title":"ACM Computing Surveys"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized Efficiency of List Update and Paging Rules. Communication of the ACM\u00a028, 202\u2013208 (1985)","journal-title":"Communication of the ACM"},{"key":"6_CR10","unstructured":"Chou, A., CooperstockJ, 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)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Applications in Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496199_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:40:02Z","timestamp":1619505602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496199_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262244","9783540324409"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11496199_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}