{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:20:55Z","timestamp":1742926855257,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031214400"},{"type":"electronic","value":"9783031214417"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-21441-7_29","type":"book-chapter","created":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T00:03:50Z","timestamp":1670198630000},"page":"346-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Time is Budget: A Heuristic for\u00a0Reducing the\u00a0Risk of\u00a0Ruin in\u00a0Multi-armed Gambler\u00a0Bandits"],"prefix":"10.1007","author":[{"given":"Filipo Studzinski","family":"Perotto","sequence":"first","affiliation":[]},{"given":"Xavier","family":"Pucel","sequence":"additional","affiliation":[]},{"given":"Jean-Loup","family":"Farges","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,5]]},"reference":[{"issue":"2\u20133","key":"29_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2\u20133), 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"issue":"3","key":"29_CR2","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/3164539","volume":"65","author":"A Badanidiyuru","year":"2018","unstructured":"Badanidiyuru, A., Kleinberg, R., Slivkins, A.: Bandits with knapsacks. J. ACM 65(3), 13:1-13:55 (2018)","journal-title":"J. ACM"},{"key":"29_CR3","first-page":"1655","volume":"12","author":"S Bubeck","year":"2011","unstructured":"Bubeck, S., Munos, R., Stoltz, G., Szepesv\u00e1ri, C.: X-armed bandits. JMLR 12, 1655\u20131695 (2011)","journal-title":"JMLR"},{"key":"29_CR4","unstructured":"Cassel, A., Mannor, S., Zeevi, A.: A general approach to multi-armed bandits under risk criteria. In: Proceedings of the COLT 2018, pp. 1295\u20131306 (2018)"},{"key":"29_CR5","unstructured":"Cesa-Bianchi, N., Fischer, P.: Finite-time regret bounds for the multiarmed Bandit problem. In: Proceedings of the 5th ICML, pp. 100\u2013108. Morgan Kaufmann (1998)"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Ding, W., Qin, T., Zhang, X., Liu, T.: Multi-armed bandit with budget constraint and variable costs. In: Proceedings of the 27th AAAI (2013)","DOI":"10.1609\/aaai.v27i1.8637"},{"key":"29_CR7","unstructured":"Galichet, N., Sebag, M., Teytaud, O.: Exploration vs exploitation vs safety: risk-aware multi-armed bandits. In: Proceedings of the 5th ACML, vol. 29, pp. 245\u2013260. PMLR (2013)"},{"key":"29_CR8","unstructured":"Garivier, A., Hadiji, H., M\u00e9nard, P., Stoltz, G.: KL-UCB-Switch: optimal regret bounds for stochastic bandits from both a distribution-dependent and a distribution-free viewpoints. CoRR abs\/1805.05071 (2018)"},{"key":"29_CR9","unstructured":"Kaufmann, E., Capp\u00e9, O., Garivier, A.: On Bayesian upper confidence bounds for bandit problems. In: Proceedings of the 15th AISTATS, pp. 592\u2013600 (2012)"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Kaufmann, E., Korda, N., Munos, R.: Thompson sampling: an asymptotically optimal finite-time analysis. In: Proceedings of the 23rd ALT, pp. 199\u2013213 (2012)","DOI":"10.1007\/978-3-642-34106-9_18"},{"key":"29_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401","volume-title":"Bandit Algorithms","author":"T Lattimore","year":"2020","unstructured":"Lattimore, T., Szepesv\u00e1ri, C.: Bandit Algorithms. Cambridge University Press, Cambridge (2020)"},{"key":"29_CR12","unstructured":"Perotto, F.S.: Gambler bandits and the regret of being ruined. In: Proceedings of the 20th AAMAS, pp. 1664\u20131667 (2021)"},{"key":"29_CR13","unstructured":"Perotto, F.S., Bourgais, M., Silva, B.C., Vercouter, L.: Open problem: risk of ruin in multiarmed Bandits. In: Proceedings of the COLT 2019, pp. 3194\u20133197 (2019)"},{"key":"29_CR14","doi-asserted-by":"publisher","unstructured":"Riou, C., Honda, J., Sugiyama, M.: The survival bandit problem (2022). https:\/\/doi.org\/10.48550\/ARXIV.2206.03019","DOI":"10.48550\/ARXIV.2206.03019"},{"key":"29_CR15","unstructured":"Sani, A., Lazaric, A., Munos, R.: Risk-aversion in multi-armed bandits. In: Proceedings of the 26th NIPS, pp. 3284\u20133292 (2012)"},{"issue":"1\u20132","key":"29_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000068","volume":"12","author":"A Slivkins","year":"2019","unstructured":"Slivkins, A.: Introduction to multi-armed Bandits. Found. Trends Mach. Learn. 12(1\u20132), 1\u2013286 (2019)","journal-title":"Found. Trends Mach. Learn."},{"key":"29_CR17","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.1998.712192","volume-title":"Introduction to Reinforcement Learning","author":"R Sutton","year":"1998","unstructured":"Sutton, R., Barto, A.: Introduction to Reinforcement Learning. MIT Press, Cambridge (1998)"},{"issue":"6","key":"29_CR18","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1109\/JSTSP.2016.2592622","volume":"10","author":"S Vakili","year":"2016","unstructured":"Vakili, S., Zhao, Q.: Risk-averse multi-armed bandit problems under mean-variance measure. J. Sel. Top. Signal Process. 10(6), 1093\u20131111 (2016)","journal-title":"J. Sel. Top. Signal Process."},{"key":"29_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/11564096_42","volume-title":"Machine Learning: ECML 2005","author":"J Vermorel","year":"2005","unstructured":"Vermorel, J., Mohri, M.: Multi-armed Bandit Algorithms and Empirical Evaluation. In: Gama, J., Camacho, R., Brazdil, P.B., Jorge, A.M., Torgo, L. (eds.) ECML 2005. LNCS (LNAI), vol. 3720, pp. 437\u2013448. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11564096_42"},{"key":"29_CR20","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.neucom.2016.12.079","volume":"258","author":"Y Xia","year":"2017","unstructured":"Xia, Y., et al.: Finite budget analysis of multi-armed bandit problems. Neurocomputing 258, 13\u201329 (2017)","journal-title":"Neurocomputing"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence XXXIX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21441-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T00:08:26Z","timestamp":1670198906000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21441-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031214400","9783031214417"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21441-7_29","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":"5 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SGAI-AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Innovative Techniques and Applications of Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambridge","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"13 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sgai2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/bcs-sgai.org\/ai2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}