{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:13:26Z","timestamp":1725516806983},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_5","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"41-51","source":"Crossref","is-referenced-by-count":0,"title":["Average-Case Competitive Analyses for One-Way Trading"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Fujiwara","sequence":"first","affiliation":[]},{"given":"Kazuo","family":"Iwama","sequence":"additional","affiliation":[]},{"given":"Yoshiyuki","family":"Sekiguchi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/978-3-540-30140-0_11","volume-title":"Algorithms \u2013 ESA 2004","author":"L. Becchetti","year":"2004","unstructured":"Becchetti, L.: Modeling locality: A Probabilistic Analysis of LRU and FWF. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 98\u2013109. Springer, Heidelberg (2004)"},{"key":"5_CR2","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1137\/S0097539799358847","volume":"31","author":"G. Chen","year":"2001","unstructured":"Chen, G., Kao, M., Lyuu, Y., Wong, H.: Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns. SIAM J. Comput.\u00a031(2), 447\u2013459 (2001)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s00453-001-0003-0","volume":"30","author":"R. El-Yaniv","year":"2001","unstructured":"El-Yaniv, R., Fiat, A., Karp, R.M., Turpin, G.: Optimal Search and One-Way Trading Online Algorithms. Algorithmica\u00a030(1), 101\u2013139 (2001)","journal-title":"Algorithmica"},{"key":"5_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-33483-2","volume-title":"Modelling Extremal Events: for Insurance and Finance","author":"P. Embrechts","year":"1997","unstructured":"Embrechts, P., Kluppelberg, C., Mikosch, T.: Modelling Extremal Events: for Insurance and Finance. Springer, London (1997)"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00453-004-1142-x","volume":"42","author":"H. Fujiwara","year":"2005","unstructured":"Fujiwara, H., Iwama, K.: Average-Case Competitive Analyses for Ski-Rental Problems. Algorithmica\u00a042(1), 95\u2013107 (2005)","journal-title":"Algorithmica"},{"key":"5_CR7","unstructured":"Garg, N., Gupta, A., Leonardi, S., Sankowski, P.: Stochastic Analyses for Online Combinatorial Optimization Problems. In: Proc. SODA 2008, pp. 942\u2013951 (2008)"},{"key":"5_CR8","volume-title":"Statistical Reliability Theory","author":"I.B. Gertzbakh","year":"1989","unstructured":"Gertzbakh, I.B.: Statistical Reliability Theory. Marcel Dekker, New York (1989)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-75520-3_26","volume-title":"Algorithms \u2013 ESA 2007","author":"J. Lorenz","year":"2007","unstructured":"Lorenz, J., Panagiotou, K., Steger, A.: Optimal Algorithms for k-Search with Application in Option Pricing. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 275\u2013286. Springer, Heidelberg (2007)"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/s00453-007-9073-y","volume":"50","author":"N. Naaman","year":"2008","unstructured":"Naaman, N., Rom, R.: Average Case Analysis of Bounded Space Bin Packing Algorithms. Algorithmica\u00a050(1), 72\u201397 (2008)","journal-title":"Algorithmica"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Panagiotou, K., Souza, A.: On Adequate Performance Measures for Paging. In: Proc. STOC 2006, pp. 487\u2013496 (2006)","DOI":"10.1145\/1132516.1132587"},{"issue":"2","key":"5_CR12","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. Commun. ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:44:55Z","timestamp":1620017095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}