{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:57:28Z","timestamp":1743116248193,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642124495"},{"type":"electronic","value":"9783642124501"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12450-1_3","type":"book-chapter","created":{"date-parts":[[2010,5,5]],"date-time":"2010-05-05T19:01:49Z","timestamp":1273086109000},"page":"25-36","source":"Crossref","is-referenced-by-count":6,"title":["Price Fluctuations: To Buy or to Rent"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","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":"1\u20133","key":"3_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0304-3975(02)00727-2","volume":"302","author":"P. Damaschke","year":"2003","unstructured":"Damaschke, P.: Nearly optimal strategies for special cases of on-line capital investment. Theoretical Computer Science\u00a0302(1\u20133), 35\u201344 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1145\/375827.375843","volume":"48","author":"D.R. Dooly","year":"2001","unstructured":"Dooly, D.R., Goldman, S.A., Scott, S.D.: On-line analysis of the TCP acknowledgment delay problem. Journal of the ACM\u00a048(2), 243\u2013273 (2001); Also appeared as TCP Dynamic Acknowledgment Delay: Theory and Practice. In: Proc. of the 30th STOC, pp. 389\u2013398 (1998)","journal-title":"Journal of the ACM"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/274440.274442","volume":"30","author":"R. El-Yaniv","year":"1998","unstructured":"El-Yaniv, R.: Competitive solutions for online financial problems. ACM Computing Surveys\u00a030(1), 28\u201369 (1998)","journal-title":"ACM Computing Surveys"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"El-Yaniv, R., Fiat, A., Karp, R.M., Turpin, G.: Competitive analysis of financial games. In: Proc.\u00a0of the 33rd IEEE Symp. on Foundations of Computer Science (FOCS), pp. 327\u2013333 (1992)","DOI":"10.1109\/SFCS.1992.267758"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","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. 12\u201314. Springer, Heidelberg (1998)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/3-540-36136-7_42","volume-title":"Algorithms and Computation","author":"H. Fujiwara","year":"2002","unstructured":"Fujiwara, H., Iwama, K.: Average-case competitive analyses for ski-rental problems. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 476\u2013488. Springer, Heidelberg (2002)"},{"key":"3_CR8","unstructured":"Garg, N., Gupta, A., Leonardi, S., Sankowski, P.: Stochastic analyses for online combinatorial optimization problems. In: Proc.\u00a0of the 19th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 942\u2013951 (2008)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s00453-003-1013-x","volume":"36","author":"A.R. Karlin","year":"2003","unstructured":"Karlin, A.R., Kenyon, C., Randall, D.: Dynamic TCP acknowledgement and other stories about e\/(e - 1). Algorithmica\u00a036, 209\u2013224 (2003); Also appeared in: Proc.\u00a0of the 33rd STOC, pp. 502\u2013509 (2001)","journal-title":"Algorithmica"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/BF01189993","volume":"11","author":"A.R. Karlin","year":"1994","unstructured":"Karlin, A.R., Manasse, M.S., McGeoch, L.A., Owicki, S.: Competitive randomized algorithms for non-uniform problems. Algorithmica\u00a011, 542\u2013571 (1994); Also appeared in: Proc. of the 1st SODA, pp. 301\u2013309 (1990)","journal-title":"Algorithmica"},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01762111","volume":"3","author":"A.R. Karlin","year":"1988","unstructured":"Karlin, A.R., Manasse, M.S., Rudolph, L., Sleator, D.D.: Competitive snoopy caching. Algorithmica\u00a03(1), 77\u2013119 (1988); Also appeared in: Proc. of the 27th FOCS, pp. 244\u2013254 (1986)","journal-title":"Algorithmica"},{"key":"3_CR12","unstructured":"Karp, R.M.: On-line algorithms versus off-line algorithms: How much is it worth to know the future? In: Proc.\u00a0of the IFIP 12th World Computer Congress, pp. 416\u2013429 (1992)"},{"key":"3_CR13","unstructured":"Lotker, Z., Patt-Shamir, B., Rawitz, D.: Rent, lease or buy: Randomized algorithms for multislope ski rental. In: Proc.\u00a0of the 25th Symp. on Theoretical Aspects of Computer Science (STACS), pp. 503\u2013514 (2008)"},{"issue":"1\u20133","key":"3_CR14","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.tcs.2005.04.006","volume":"341","author":"G. Sch\u00e4fer","year":"2005","unstructured":"Sch\u00e4fer, G., Sivadasan, N.: Topology matters: Smoothed competitiveness of metrical task systems. Theoretical Computer Science\u00a0341(1\u20133), 216\u2013246 (2005); Also appeared in: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 489\u2013500. Springer, Heidelberg (2004)","journal-title":"Theoretical Computer Science"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Probabilistic computation: towards a uniform measure of complexity. In: Proc.\u00a0of the 18th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 222\u2013227 (1977)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12450-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T10:50:27Z","timestamp":1674816627000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-12450-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642124495","9783642124501"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12450-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}