{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T06:04:52Z","timestamp":1748930692602,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,5,5]],"date-time":"2021-05-05T00:00:00Z","timestamp":1620172800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,5]],"date-time":"2021-05-05T00:00:00Z","timestamp":1620172800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004410","name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ftirma Kurumu","doi-asserted-by":"publisher","award":["Grant 215E342"],"award-info":[{"award-number":["Grant 215E342"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008967","name":"Bilim Akademisi","doi-asserted-by":"publisher","award":["BAGEP Award"],"award-info":[{"award-number":["BAGEP Award"]}],"id":[{"id":"10.13039\/501100008967","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s10994-021-05956-1","type":"journal-article","created":{"date-parts":[[2021,5,5]],"date-time":"2021-05-05T21:03:05Z","timestamp":1620248585000},"page":"1233-1266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multi-objective multi-armed bandit with lexicographically ordered and satisficing objectives"],"prefix":"10.1007","volume":"110","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5621-5698","authenticated-orcid":false,"given":"Alihan","family":"H\u00fcy\u00fck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4361-4021","authenticated-orcid":false,"given":"Cem","family":"Tekin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,5]]},"reference":[{"key":"5956_CR1","unstructured":"Abbasi-Yadkori, Y., P\u00e1l, D., & Szepesv\u00e1ri, C. (2011). Improved algorithms for linear stochastic bandits. In Advances in neural information processing systems (pp. 2312\u20132320)."},{"issue":"29\u201330","key":"5956_CR2","doi-asserted-by":"publisher","first-page":"2712","DOI":"10.1016\/j.tcs.2010.04.007","volume":"411","author":"A Antos","year":"2010","unstructured":"Antos, A., Grover, V., & Szepesv\u00e1ri, C. (2010). Active learning in heteroscedastic noise. Theoretical Computer Science, 411(29\u201330), 2712\u20132728.","journal-title":"Theoretical Computer Science"},{"key":"5956_CR3","doi-asserted-by":"crossref","unstructured":"Bubeck, S., & Liu, C. (2013). Prior-free and prior-dependent regret bounds for thompson sampling. In Advances in neural information processing systems (pp 638\u2013646)","DOI":"10.1109\/CISS.2014.6814158"},{"key":"5956_CR4","unstructured":"Bubeck, S., Perchet, V., & Rigollet, P. (2013). Bounded regret in stochastic multi-armed bandits. In Proceedings of the conference on learning theory (pp. 122\u2013134)."},{"issue":"7553","key":"5956_CR5","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1038\/nature14422","volume":"521","author":"A Cully","year":"2015","unstructured":"Cully, A., Clune, J., Tarapode, D., & Mouret, J. (2015). Robots that can adapt like animals. Nature, 521(7553), 503\u2013507.","journal-title":"Nature"},{"key":"5956_CR6","doi-asserted-by":"crossref","unstructured":"Drugan, M., & Nowe, A. (2013). Designing multi-objective multi-armed Bandtis algorithms: A study. In Proceedings of the 2013 international joint conference on neural networks (pp. 1\u20138).","DOI":"10.1109\/IJCNN.2013.6707036"},{"key":"5956_CR7","volume-title":"Multicriteria optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M. (2005). Multicriteria optimization (Vol. 491). Springer."},{"issue":"11","key":"5956_CR8","doi-asserted-by":"publisher","first-page":"1442","DOI":"10.1287\/mnsc.20.11.1442","volume":"20","author":"P Fishburn","year":"1974","unstructured":"Fishburn, P. (1974). Exceptional paper\u2013lexicographic orders, utilities and decision rules: A survey. Management Science, 20(11), 1442\u20131472.","journal-title":"Management Science"},{"issue":"5","key":"5956_CR9","doi-asserted-by":"publisher","first-page":"1466","DOI":"10.1109\/TNET.2011.2181864","volume":"20","author":"Y Gai","year":"2012","unstructured":"Gai, Y., Krishnamachari, B., & Jain, R. (2012). Combinatorial network optimization with unknown variables: Multi-armed bandits with linear rewards and individual observations. IEEE\/ACM Transactions on Networking, 20(5), 1466\u20131478.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"5956_CR10","doi-asserted-by":"crossref","unstructured":"Garivier, A., M\u00e9nard, P., & Stoltz, G. (2018). Explore first, exploit next, the true shape of regret in bandit problems. Mathematics of Operations Research.","DOI":"10.1287\/moor.2017.0928"},{"key":"5956_CR11","doi-asserted-by":"crossref","unstructured":"Jee, K., McShan, D., & Fraass, B. (2007). Lexicographic ordering: intuitive multicriteria optimization for imrt. Physics in Medicine & Biology, 52(7).","DOI":"10.1088\/0031-9155\/52\/7\/006"},{"key":"5956_CR12","unstructured":"Joseph, M., Kearns, M., Morgenstern, J., & Roth, A. (2016). Fairness in learning: classic and contextual bandits. In Advances in neural information processing systems (pp. 325\u2013333)."},{"key":"5956_CR13","first-page":"1630","volume":"6","author":"J Konstan","year":"2006","unstructured":"Konstan, J., McNee, S., Ziegler, C., Torres, R., Kapoor, N., & Riedl, J. (2006). Lessons on applying automated recommender systems to information-seeking tasks. Proceedings of the AAAI Conference on Artificial Intelligence, 6, 1630\u20131633.","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"issue":"4","key":"5956_CR14","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1073\/pnas.81.4.1284","volume":"81","author":"T Lai","year":"1984","unstructured":"Lai, T., & Robbins, H. (1984). Optimal sequential sampling from two populations. Proceedings of the National Academy of Sciences of the Unites States of America, 81(4), 1284\u20131286.","journal-title":"Proceedings of the National Academy of Sciences of the Unites States of America"},{"issue":"1","key":"5956_CR15","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/0196-8858(85)90002-8","volume":"6","author":"T Lai","year":"1985","unstructured":"Lai, T., & Robbins, H. (1985). Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics, 6(1), 4\u201322.","journal-title":"Advances in Applied Mathematics"},{"key":"5956_CR16","unstructured":"Lattimore, T., & Munos, R. (2014). Bounded regret for finite-armed structured bandits. In Advances in neural informations processing systems (pp. 550\u2013558)."},{"key":"5956_CR17","volume-title":"Bandit algorithms","author":"T Lattimore","year":"2019","unstructured":"Lattimore, T., & Szepesv\u00e1ri, C. (2019). Bandit algorithms. Cambridge University Press. Preprint."},{"key":"5956_CR18","unstructured":"Locatelli, A., Gutzeit, M., & Carpentier, A. (2016). An optimal algorithm for the thresholding bandit problem. In Proceedings of the 33rd international conference on machine learning (pp. 1690\u20131698)."},{"issue":"12","key":"5956_CR19","doi-asserted-by":"publisher","first-page":"2787","DOI":"10.1109\/TAC.2009.2031725","volume":"54","author":"A Mersereau","year":"2009","unstructured":"Mersereau, A., Rusmevichientong, P., & Tsitsiklis, J. (2009). A structured multiarmed bandit problem and the greedy policy. IEEE Transactions on Automatic Control, 54(12), 2787\u20132802.","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"8","key":"5956_CR20","doi-asserted-by":"publisher","first-page":"3788","DOI":"10.1109\/TAC.2016.2644380","volume":"62","author":"P Reverdy","year":"2017","unstructured":"Reverdy, P., Srivastava, V., & Leonard, N. (2017). Satisficing in multi-armed bandit problems. IEEE Transactions on Automatic Control, 62(8), 3788\u20133803.","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"3","key":"5956_CR21","doi-asserted-by":"publisher","first-page":"1490","DOI":"10.1109\/TVT.2008.928898","volume":"58","author":"V Shah-Mansouri","year":"2009","unstructured":"Shah-Mansouri, V., Mohsenian-Rad, A., & Wong, V. (2009). Lexicographically optimal routing for wireless sensor networks with multiple sinks. IEEE Transactions on Vehicular Technology, 58(3), 1490\u20131500.","journal-title":"IEEE Transactions on Vehicular Technology"},{"issue":"1","key":"5956_CR22","first-page":"1673","volume":"15","author":"A Slivkins","year":"2014","unstructured":"Slivkins, A. (2014). Contextual bandits with similarity information. Journal of Machine Learning Research, 15(1), 1673\u20131681.","journal-title":"Journal of Machine Learning Research"},{"issue":"14","key":"5956_CR23","doi-asserted-by":"publisher","first-page":"3799","DOI":"10.1109\/TSP.2018.2841822","volume":"66","author":"C Tekin","year":"2018","unstructured":"Tekin, C., & Turgay, E. (2018). Multi-objective contextual multi-armed bandit with a dominant objective. IEEE Transactions on Signal Processing, 66(14), 3799\u20133813.","journal-title":"IEEE Transactions on Signal Processing"},{"key":"5956_CR24","unstructured":"Turgay, E., \u00d6ner, D., & Tekin, C. (2018). Multi-objective contextual bandit problem with similarity information. In Proceedings of the 21st international conference on artificial intelligence and statistics (pp. 1673\u20131681)."},{"key":"5956_CR25","doi-asserted-by":"crossref","unstructured":"Vakili, S., & Zhao, Q. (2013). Achieving complete learning in multi-armed bandit problems. In Proceedings of the 2013 asilomar conference on signals, systems and computers (pp. 1778\u20131782).","DOI":"10.1109\/ACSSC.2013.6810607"},{"key":"5956_CR26","doi-asserted-by":"publisher","first-page":"4511","DOI":"10.1073\/pnas.1000488107","volume":"107","author":"T Zhou","year":"2010","unstructured":"Zhou, T., Kuscsik, Z., Liu, J., Medo, M., Wakeling, J., & Zhang, Y. (2010). Solving the apparent diversity-accuracy dilemma of recommender systems. Proceedings of the National Academy of Sciences, 107, 4511\u20134515.","journal-title":"Proceedings of the National Academy of Sciences"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-05956-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-021-05956-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-05956-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T01:03:48Z","timestamp":1651712628000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-021-05956-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,5]]},"references-count":26,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["5956"],"URL":"https:\/\/doi.org\/10.1007\/s10994-021-05956-1","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2021,5,5]]},"assertion":[{"value":"3 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}