{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:25:51Z","timestamp":1725474351111},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642318658"},{"type":"electronic","value":"9783642318665"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-31866-5_25","type":"book-chapter","created":{"date-parts":[[2012,7,18]],"date-time":"2012-07-18T21:51:08Z","timestamp":1342648268000},"page":"295-305","source":"Crossref","is-referenced-by-count":7,"title":["Online Sparse Bandit for Card Games"],"prefix":"10.1007","author":[{"given":"David L.","family":"St-Pierre","sequence":"first","affiliation":[]},{"given":"Quentin","family":"Louveaux","sequence":"additional","affiliation":[]},{"given":"Olivier","family":"Teytaud","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Audibert, J.Y., Bubeck, S.: Minimax policies for adversarial and stochastic bandits. In: 22nd Annual Conference on Learning Theory (COLT), Montreal (June 2009)"},{"key":"25_CR2","unstructured":"Audibert, J.-Y., Bubeck, S.: Regret bounds and minimax policies under partial monitoring. Journal of Machine Learning Research (October 2010)"},{"key":"25_CR3","first-page":"322","volume-title":"Proceedings of the 36th Annual Symposium on Foundations of Computer Science","author":"P. Auer","year":"1995","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: Gambling in a rigged casino: the adversarial multi-armed bandit problem. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pp. 322\u2013331. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-642-20525-5_6","volume-title":"Applications of Evolutionary Computation","author":"D. Auger","year":"2011","unstructured":"Auger, D.: Multiple Tree for Partially Observable Monte-Carlo Tree Search. In: Di Chio, C., Cagnoni, S., Cotta, C., Ebner, M., Ek\u00e1rt, A., Esparcia-Alc\u00e1zar, A.I., Merelo, J.J., Neri, F., Preuss, M., Richter, H., Togelius, J., Yannakakis, G.N. (eds.) EvoApplications 2011, Part I. LNCS, vol.\u00a06624, pp. 53\u201362. Springer, Heidelberg (2011)"},{"issue":"2","key":"25_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0167-6377(95)00032-0","volume":"18","author":"M.D. Grigoriadis","year":"1995","unstructured":"Grigoriadis, M.D., Khachiyan, L.G.: A sublinear-time randomized approximation algorithm for matrix games. Operations Research Letters\u00a018(2), 53\u201358 (1995)","journal-title":"Operations Research Letters"},{"issue":"1","key":"25_CR6","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.: Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics\u00a06(1), 4\u201322 (1985)","journal-title":"Advances in Applied Mathematics"},{"key":"25_CR7","first-page":"1078","volume":"22","author":"M. Lanctot","year":"2009","unstructured":"Lanctot, M., Waugh, K., Zinkevich, M., Bowling, M.: Monte Carlo Sampling for Regret Minimization in Extensive Games. Advances in Neural Information Processing Systems\u00a022, 1078\u20131086 (2009)","journal-title":"Advances in Neural Information Processing Systems"},{"key":"25_CR8","unstructured":"Ponsen, M., Lanctot, M., de Jong, S.: MCRNR: Fast Computing of Restricted Nash Responses by Means of Sampling. In: Proceedings of Interactive Decision Theory and Game Theory Workshop, AAAI 2010 (2010)"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-20525-5_16","volume-title":"Applications of Evolutionary Computation","author":"O. Teytaud","year":"2011","unstructured":"Teytaud, O., Flory, S.: Upper Confidence Trees with Short Term Partial Information. In: Di Chio, C., Cagnoni, S., Cotta, C., Ebner, M., Ek\u00e1rt, A., Esparcia-Alc\u00e1zar, A.I., Merelo, J.J., Neri, F., Preuss, M., Richter, H., Togelius, J., Yannakakis, G.N. (eds.) EvoApplications 2011, Part I. LNCS, vol.\u00a06624, pp. 153\u2013162. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Games"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31866-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:55:44Z","timestamp":1558299344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31866-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642318658","9783642318665"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31866-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}