{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T19:18:00Z","timestamp":1768591080775,"version":"3.49.0"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032067050","type":"print"},{"value":"9783032067067","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-06706-7_6","type":"book-chapter","created":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T23:46:14Z","timestamp":1759275974000},"page":"81-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Controlling Tail Risk in\u00a0Two-Slope Ski Rental"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-0638-0831","authenticated-orcid":false,"given":"Qiming","family":"Cui","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2632-966X","authenticated-orcid":false,"given":"Michael","family":"Dinitz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,1]]},"reference":[{"key":"6_CR1","unstructured":"Christianson, N., Sun, B., Low, S., Wierman, A.: Risk-sensitive online algorithms (extended abstract). In: Agrawal, S., Roth, A. (eds.) Proceedings of Thirty Seventh Conference on Learning Theory. Proceedings of Machine Learning Research, 30 Jun\u201303 Jul, vol.\u00a0247, pp. 1140\u20131141. PMLR (2024)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Cui, Q., Dinitz, M.: Controlling tail risk in two-slope ski rental (2025). arXiv:2508.06809","DOI":"10.1007\/978-3-032-06706-7_6"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Dinitz, M., Im, S., Lavastida, T., Moseley, B., Vassilvitskii, S.: Controlling tail risk in online ski-rental. In: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 4247\u20134263. SIAM (2024)","DOI":"10.1137\/1.9781611977912.147"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-642-25591-5_56","volume-title":"Algorithms and Computation","author":"H Fujiwara","year":"2011","unstructured":"Fujiwara, H., Kitano, T., Fujito, T.: On the best possible competitive ratio for multislope ski rental. In: Asano, T., Nakano, S., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol. 7074, pp. 544\u2013553. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25591-5_56"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Karlin, A.R., Kenyon, C., Randall, D.: Dynamic tcp acknowledgement and other stories about e\/(e-1). In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, STOC 2001, pp. 502\u2013509. Association for Computing Machinery, New York (2001)","DOI":"10.1145\/380752.380845"},{"key":"6_CR6","unstructured":"Karlin, A.R., Manasse, M.S., McGeoch, L.A., Owicki, S.: Competitive randomized algorithms for non-uniform problems. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1990, pp. 301\u2013309. Society for Industrial and Applied Mathematics, USA (1990)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Karlin, A.R., Manasse, M.S., Rudolph, L., Sleator, D.D.: Competitive snoopy caching. In: 27th Annual Symposium on Foundations of Computer Science, pp. 244\u2013254 (1986)","DOI":"10.1109\/SFCS.1986.14"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Levi, A., Patt-Shamir, B.: Non-additive two-option ski rental. Theoretical Computer Science 584, 42\u201352 (2015), special Issue on Structural Information and Communication Complexity","DOI":"10.1016\/j.tcs.2015.01.038"},{"issue":"6","key":"6_CR9","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.ipl.2008.07.009","volume":"108","author":"Z Lotker","year":"2008","unstructured":"Lotker, Z., Patt-Shamir, B., Rawitz, D.: Ski rental with two general options. Inf. Process. Lett. 108(6), 365\u2013368 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"6_CR10","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/100794018","volume":"26","author":"Z Lotker","year":"2012","unstructured":"Lotker, Z., Patt-Shamir, B., Rawitz, D.: Rent, lease, or buy: randomized algorithms for multislope ski rental. SIAM J. Discret. Math. 26(2), 718\u2013736 (2012)","journal-title":"SIAM J. Discret. Math."}],"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-032-06706-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T07:08:45Z","timestamp":1768547325000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-06706-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"ISBN":["9783032067050","9783032067067"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-06706-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,1]]},"assertion":[{"value":"1 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2025\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}