{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:27:23Z","timestamp":1725470843120},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540462675"},{"type":"electronic","value":"9783540462682"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11889205_40","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T12:07:42Z","timestamp":1159445262000},"page":"560-574","source":"Crossref","is-referenced-by-count":12,"title":["A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem"],"prefix":"10.1007","author":[{"given":"Matthew J.","family":"Streeter","sequence":"first","affiliation":[]},{"given":"Stephen F.","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_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. Machine Learning\u00a047, 235\u2013256 (2002a)","journal-title":"Machine Learning"},{"issue":"1","key":"40_CR2","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(1), 48\u201377 (2002b)","journal-title":"SIAM Journal on Computing"},{"key":"40_CR3","volume-title":"Bandit Problems: Sequential Allocation of Experiments","author":"D.A. Berry","year":"1986","unstructured":"Berry, D.A., Fristedt, B.: Bandit Problems: Sequential Allocation of Experiments. Chapman and Hall, London (1986)"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Cicirello, V.A., Smith, S.F.: Heuristic selection for stochastic search optimization: Modeling solution quality by extreme value theory. In: Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming, pp. 197\u2013211 (2004)","DOI":"10.1007\/978-3-540-30201-8_17"},{"key":"40_CR5","unstructured":"Cicirello, V.A., Smith, S.F.: The max k-armed bandit: A new model of exploration applied to search heuristic selection. In: Proceedings of the Twentieth National Conference on Artificial Intelligence, pp. 1355\u20131361 (2005)"},{"key":"40_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-3675-0","volume-title":"An Introduction to Statistical Modeling of Extreme Values","author":"S. Coles","year":"2001","unstructured":"Coles, S.: An Introduction to Statistical Modeling of Extreme Values. Springer, London (2001)"},{"key":"40_CR7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4168.001.0001","volume-title":"Learning in Embedded Systems","author":"L.P. Kaelbling","year":"1993","unstructured":"Kaelbling, L.P.: Learning in Embedded Systems. The MIT Press, Cambridge (1993)"},{"issue":"3","key":"40_CR8","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1214\/aos\/1176350495","volume":"15","author":"T.L. Lai","year":"1987","unstructured":"Lai, T.L.: Adaptive treatment allocation and the multi-armed bandit problem. The Annals of Statistics\u00a015(3), 1091\u20131114 (1987)","journal-title":"The Annals of Statistics"},{"issue":"3","key":"40_CR9","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/mnsc.49.3.330.12737","volume":"49","author":"R.H. M\u00f6hring","year":"2003","unstructured":"M\u00f6hring, R.H., Schulz, A.S., Stork, F., Uetz, M.: Solving project scheduling problems by minimum cut computations. Management Science\u00a049(3), 330\u2013350 (2003)","journal-title":"Management Science"},{"key":"40_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22341-3","volume-title":"Project Scheduling with Time Windows and Scarce Resources","author":"K. Neumann","year":"2002","unstructured":"Neumann, K., Schwindt, C., Zimmerman, J.: Project Scheduling with Time Windows and Scarce Resources. Springer, Heidelberg (2002)"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1090\/S0002-9904-1952-09620-8","volume":"58","author":"H. Robbins","year":"1952","unstructured":"Robbins, H.: Some aspects of sequential design of experiments. Bulletin of the American Mathematical Society\u00a058, 527\u2013535 (1952)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"40_CR12","unstructured":"Schwindt, C.: Generation of resource\u2013constrained project scheduling problems with minimal and maximal time lags. Technical Report WIOR-489, Universit\u00e4t Karlsruhe (1996)"},{"key":"40_CR13","unstructured":"Streeter, M.J., Smith, S.F.: An asymptotically optimal algorithm for the max k-armed bandit problem. In: Proceedings of the Twenty-First National Conference on Artificial Intelligence (2006)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11889205_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:51:28Z","timestamp":1605642688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11889205_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462675","9783540462682"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11889205_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}