{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:32:38Z","timestamp":1648618358415},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,2,21]],"date-time":"2008-02-21T00:00:00Z","timestamp":1203552000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s12351-008-0007-5","type":"journal-article","created":{"date-parts":[[2008,2,20]],"date-time":"2008-02-20T08:53:53Z","timestamp":1203497633000},"page":"105-122","source":"Crossref","is-referenced-by-count":0,"title":["A comparative study of ad hoc techniques and evolutionary methods for multi-armed bandit problems"],"prefix":"10.1007","volume":"8","author":[{"given":"D. E.","family":"Koulouriotis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Xanthopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,2,21]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Auer P, Cesa-Bianchi N, Freund Y, Schapire RE (1995) 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","DOI":"10.1109\/SFCS.1995.492488"},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-9236(03)00061-7","volume":"38","author":"R Azoulay-Schwartz","year":"2004","unstructured":"Azoulay-Schwartz R, Kraus S, Wilkenfeld J (2004) Exploitation vs. exploration: choosing a supplier in an environment of incomplete information. Decis Support Syst 38:1\u201318","journal-title":"Decis Support Syst"},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"687","DOI":"10.2307\/2951664","volume":"62","author":"JS Banks","year":"1994","unstructured":"Banks JS, Sundaram RK (1994) Switching costs and the Gittins index. Econometrica 62:687\u2013694","journal-title":"Econometrica"},{"key":"7_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-3711-7","volume-title":"Bandit problems: sequential allocation of experiments","author":"DA Berry","year":"1985","unstructured":"Berry DA, Fristedt B (1985) Bandit problems: sequential allocation of experiments. Chapman and Hall, London"},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0165-1889(01)00028-8","volume":"27","author":"M Brezzi","year":"2002","unstructured":"Brezzi M, Lai TL (2002) Optimal learning and experimentation in bandit problems. J Econ Dyn Control 27:87\u2013107","journal-title":"J Econ Dyn Control"},{"issue":"2","key":"7_CR6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1108\/09685220510589316","volume":"13","author":"DV Chulkov","year":"2005","unstructured":"Chulkov DV, Desai MS (2005) Information technology project failures: applying the bandit problem to evaluate managerial decision making. Inf Manag Comp Secur 13(2): 135\u2013143","journal-title":"Inf Manag Comp Secur"},{"issue":"1","key":"7_CR18","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1006\/jtbi.2000.2166","volume":"207","author":"DB Fogel","year":"2000","unstructured":"Fogel DB, Beyer HG (2000) Do evolutionary processes minimize expected losses? J Theor Biol 207(1):117\u2013123","journal-title":"J Theor Biol"},{"key":"7_CR7","volume-title":"Multi-armed bandit allocation indices","author":"JC Gittins","year":"1989","unstructured":"Gittins JC (1989) Multi-armed bandit allocation indices. Wiley, New York"},{"key":"7_CR8","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s10645-004-2477-z","volume":"152","author":"T Jun","year":"2004","unstructured":"Jun T (2004) A survey on the bandit problem with switching costs. Economist 152:513\u2013541","journal-title":"Economist"},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1613\/jair.301","volume":"4","author":"LP Kaelbling","year":"1996","unstructured":"Kaelbling LP, Littman ML, Moore AW (1996) Reinforcement learning: a survey. J Artif Intell Res 4: 237\u2013285","journal-title":"J Artif Intell Res"},{"issue":"4","key":"7_CR10","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.1214\/aoap\/1028903380","volume":"8","author":"H Kaspi","year":"1998","unstructured":"Kaspi H, Mandelbaum A (1998) Multi-armed bandits in discrete and continuous time. Ann Appl Probab 8(4):1270\u20131290","journal-title":"Ann Appl Probab"},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1023\/A:1011546021787","volume":"1","author":"B Leloup","year":"2001","unstructured":"Leloup B, Deveaux L (2001) Dynamic pricing on the internet: theory and simulations. Electron Commer Res 1:265\u2013276","journal-title":"Electron Commer Res"},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0165-1765(81)90021-5","volume":"8","author":"BP McCall","year":"1981","unstructured":"McCall BP, McCall JJ (1981) Systematic search, related information and the Gittins\u2019 index. Econ Lett 8:327\u2013333","journal-title":"Econ Lett"},{"issue":"2","key":"7_CR13","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/0167-6377(82)90050-5","volume":"1","author":"DR Robinson","year":"1982","unstructured":"Robinson DR (1982) Algorithms for evaluating the dynamic allocation index. Oper Res Lett 1(2):72\u201374","journal-title":"Oper Res Lett"},{"key":"7_CR14","volume-title":"Reinforcement learning: an introduction","author":"RS Sutton","year":"1998","unstructured":"Sutton RS, Barto AG (1998) Reinforcement learning: an introduction. MIT Press, Cambridge"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Thierens D (2005) An adaptive pursuit strategy for allocating operator probabilities. In Proceedings of the genetic and evolutionary computing conference (GECCO 2005), pp 1539\u20131546","DOI":"10.1145\/1068009.1068251"},{"issue":"7","key":"7_CR16","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1108\/01437720310502168","volume":"24","author":"I Valsecchi","year":"2003","unstructured":"Valsecchi I (2003) Job assignment and bandit problems. Int J Manpow 24(7):844\u2013866","journal-title":"Int J Manpow"},{"issue":"5","key":"7_CR17","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1109\/TAC.1985.1103989","volume":"30","author":"JC VaraiyaPP Walrand","year":"1985","unstructured":"Varaiya PP Walrand JC, Buyukkoc C (1985) Extensions of the multi armed bandit problem: The discounted case. IEEE Trans Autom Control 30(5):426\u2013439","journal-title":"IEEE Trans Autom Control"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-008-0007-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-008-0007-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-008-0007-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T08:04:32Z","timestamp":1559462672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-008-0007-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2,21]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["7"],"URL":"https:\/\/doi.org\/10.1007\/s12351-008-0007-5","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2,21]]}}}