{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T15:45:54Z","timestamp":1773243954128,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642161070","type":"print"},{"value":"9783642161087","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16108-7_30","type":"book-chapter","created":{"date-parts":[[2010,8,31]],"date-time":"2010-08-31T08:58:37Z","timestamp":1283245117000},"page":"375-389","source":"Crossref","is-referenced-by-count":32,"title":["Algorithms for Adversarial Bandit Problems with Multiple Plays"],"prefix":"10.1007","author":[{"given":"Taishi","family":"Uchiya","sequence":"first","affiliation":[]},{"given":"Atsuyoshi","family":"Nakamura","sequence":"additional","affiliation":[]},{"given":"Mineichi","family":"Kudo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Abernethy, J., Hazan, E., Rakhlin, A.: Competing in the dark: An efficient algorithm for bandit linear optimization. In: Proceedings of the 21st Annual Conference on Learning Theory, COLT 2008 (2008)"},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1080\/17442509008833627","volume":"29","author":"R. Agrawal","year":"1990","unstructured":"Agrawal, R., Hegde, M.V., Teneketzis, D.: Multi-armed bandits with multiple plays and switching cost. Stochastic and Stochastic Reports\u00a029, 437\u2013459 (1990)","journal-title":"Stochastic and Stochastic Reports"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1109\/TAC.1987.1104491","volume":"32","author":"V. Anantharam","year":"1986","unstructured":"Anantharam, V., Varaiya, P., Walrand, J.: Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays \u2013part i: I.i.d. rewards. IEEE Transactions on Automatic Control\u00a032, 968\u2013976 (1986)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-bianchi, N., Freund, Y., Schapire, R.E.: The nonstochastic multiarmed bandit problem. SIAM Journal on Computing\u00a032, 48\u201377 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"30_CR5","unstructured":"Cesa-bianchi, N., Lugosi, G.: Combinatorial bandits. In: Proceedings of the 22nd Annual Conference on Learning Theory, COLT 2009 (2009)"},{"issue":"3","key":"30_CR6","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1145\/1147954.1147956","volume":"53","author":"R. Gandhi","year":"2006","unstructured":"Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding and its applications to approximation algorithms. Journal of the ACM\u00a053(3), 320\u2013360 (2006)","journal-title":"Journal of the ACM"},{"key":"30_CR7","first-page":"2369","volume":"8","author":"A. Gy\u00f6rgy","year":"2007","unstructured":"Gy\u00f6rgy, A., Linder, T., Lugosi, G., Ottucs\u00e1k, G.: The on-line shortest path problem under partial monitoring. Journal of Machine Learning Research\u00a08, 2369\u20132403 (2007)","journal-title":"Journal of Machine Learning Research"},{"key":"30_CR8","unstructured":"Kleinberg, R.: Notes from week 8: Multi-armed bandit problems. CS 683\u2013Learning, Games, and Electronic Markets (2007), http:\/\/www.cs.cornell.edu\/courses\/cs683\/2007sp\/lecnotes\/week8.pdf"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Krein, M., Milman, D.: On extreme points of regular convex sets. Studia Mathematica, 133\u2013138 (1940)","DOI":"10.4064\/sm-9-1-133-138"},{"key":"30_CR10","first-page":"121","volume-title":"Foundations and Applications of Sensor Management","author":"A. Mahajan","year":"2007","unstructured":"Mahajan, A., Teneketzis, D.: Multi-armed bandit problems. In: Foundations and Applications of Sensor Management, pp. 121\u2013151. Springer, Heidelberg (2007)"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1023\/B:ELEC.0000045974.88926.88","volume":"5","author":"A. Nakamura","year":"2005","unstructured":"Nakamura, A., Abe, N.: Improvements to the linear programming based scheduling of web advertisements. Electronic Commerce Research\u00a05, 75\u201398 (2005)","journal-title":"Electronic Commerce Research"},{"key":"30_CR12","unstructured":"Niculescu-Mizil, A.: Multi-armed bandits with betting. In: COLT 2009 Workshop, pp. 133\u2013138 (2009)"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s001860050080","volume":"50","author":"D.G. Pandelis","year":"1999","unstructured":"Pandelis, D.G., Tenekezis, D.: On the optimality of the gittins index rule in multi-armed bandits with multiple plays. Mathematical Methods of Operations Research\u00a050, 449\u2013461 (1999)","journal-title":"Mathematical Methods of Operations Research"},{"key":"30_CR14","first-page":"1","volume":"60","author":"N.O. Song","year":"2004","unstructured":"Song, N.O., Teneketzis, D.: Discrete search with multiple sensors. Mathematical Methods of Operations Research\u00a060, 1\u201314 (2004)","journal-title":"Mathematical Methods of Operations Research"},{"key":"30_CR15","unstructured":"Uchiya, T., Nakamura, A., Kudo, M.: Adversarial bandit problems with multiple plays. In: The IEICE Technical Report, COMP2009-27 (2009)"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Warmuth, M.K., Takimoto, E.: Path kernels and multiplicative updates. Journal of Machine Learning Research, 773\u2013818 (2003)","DOI":"10.1007\/3-540-45435-7_6"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16108-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,7]],"date-time":"2021-11-07T13:08:09Z","timestamp":1636290489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16108-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161070","9783642161087"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16108-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}