{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:35Z","timestamp":1759638755639,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030967307"},{"type":"electronic","value":"9783030967314"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-96731-4_18","type":"book-chapter","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:03:49Z","timestamp":1647389029000},"page":"213-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Machine Learning Advised Ski Rental Problem with a Discount"],"prefix":"10.1007","author":[{"given":"Arghya","family":"Bhattacharya","sequence":"first","affiliation":[]},{"given":"Rathish","family":"Das","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"key":"18_CR1","unstructured":"Anand, K., Ge, R., Panigrahi, D.: Customizing ml predictions for online algorithms. In: Proceedings of the 37th International Conference on Machine Learning. PMLR (2020)"},{"key":"18_CR2","unstructured":"Awerbuch, B., Azar, Y.: Buy-at-bulk network design. In: Symposium on Foundations of Computer Science (1997)"},{"key":"18_CR3","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"18_CR4","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 42, 95\u2013107 (2005)","journal-title":"Algorithmica"},{"key":"18_CR5","unstructured":"Gollapudi, S., Panigrahi, D.: Online algorithms for rent-or-buy with expert advice. In: Proceedings of the 36th International Conference on Machine Learning (ICML). ACM (2019)"},{"key":"18_CR6","unstructured":"Irani, S., Ramanathan, D.: The problem of renting versus buying. Private communication, August 1998"},{"issue":"3","key":"18_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s00453-003-1013-x","volume":"36","author":"AR Karlin","year":"2003","unstructured":"Karlin, A.R., Kenyon, C., Randall, D.: Dynamic TCP acknowledgement and other stories about $$e \/ (e - 1)$$. Algorithmica 36(3), 209\u2013224 (2003)","journal-title":"Algorithmica"},{"issue":"6","key":"18_CR8","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/BF01189993","volume":"11","author":"AR Karlin","year":"1994","unstructured":"Karlin, A.R., Manasse, M.S., McGeoch, L.A., Owicki, S.: Competitive randomized algorithms for nonuniform problems. Algorithmica 11(6), 542\u2013571 (1994)","journal-title":"Algorithmica"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Khanafer, A., Kodialam, M., Puttaswamy, K.P.N.: The constrained ski-rental problem and its application to online cloud cost optimization. In: Proceedings of IEEE INFOCOM, Turin, Italy, pp. 1492\u20131500. INFOCOM, IEEE (2013)","DOI":"10.1109\/INFCOM.2013.6566944"},{"key":"18_CR10","unstructured":"Kumar, R., Purohit, M., Svitkina, Z.: Improving online algorithms via ML predictions. In: Proceedings of 32nd Conference on Neural Information Processing Systems (NeurIPS) (2018)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Lattanzi, S., Lavastida, T., Moseley, B., Vassilvitskii, S.: Online scheduling via learned weights. In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1859\u20131877 (2020)","DOI":"10.1137\/1.9781611975994.114"},{"key":"18_CR12","unstructured":"Lotker, Z., Patt-Shamir, B., Rawitz, D.: Rent, lease or buy: randomized algorithms for multislope ski rental. In: Proceedings of 25th Annual Symposium on the Theoretical Aspects of Computer Science, Bordeaux, France, pp. 503\u2013514. STACS (2008)"},{"key":"18_CR13","unstructured":"Lykouris, T., Vassilvitskii, S.: Competitive caching with machine learned advice. In: Proceedings of the 35th International Conference on Machine Learning (2018)"},{"key":"18_CR14","unstructured":"Medina, A.M., Vassilvitskii, S.: Revenue optimization with approximate bid predictions. In: 31st Conference on Neural Information Processing Systems (NeurIPS) (2017)"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Meyerson, A.: The parking permit problem. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 274\u2013284 (2005)","DOI":"10.1109\/SFCS.2005.72"},{"key":"18_CR16","unstructured":"Mitzenmacher, M.: Scheduling with predictions and the price of misprediction. In: Proceedings of Innovations in Theoretical Computer Science (ITCS) (2020)"},{"key":"18_CR17","unstructured":"Rakhlin, A., Sridharan, K.: Online learning with predictable sequences. In: Proceedings of the 26th Annual Conference on Learning Theory (COLT) (2013)"},{"key":"18_CR18","unstructured":"Sculley, D., et al.: Hidden technical debt in machine learning systems. In: Proceedings of the 28th International Conference on Neural Information Processing Systems (NIPS), pp. 2503\u20132511. MIT Press (2015)"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10898-006-9079-z","volume":"38","author":"Y Xu","year":"2007","unstructured":"Xu, Y., Xu, W., Li, H.: On the on-line rent-or-buy problem in probabilistic environments. J. Glob. Optim. 38, 1\u201320 (2007)","journal-title":"J. Glob. Optim."},{"issue":"18","key":"18_CR20","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1016\/j.ipl.2011.06.012","volume":"111","author":"G Zhang","year":"2011","unstructured":"Zhang, G., Poon, C.K., Xu, Y.: The ski-rental problem with multiple discount options. Inf. Process. Lett. 111(18), 903\u2013906 (2011)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-96731-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T10:04:54Z","timestamp":1726826694000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96731-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967307","9783030967314"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96731-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jember","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/walcom2022.unej.ac.id\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"89","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2-9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The proceedings also include 3 invited papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}