{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:24:20Z","timestamp":1757312660633,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T00:00:00Z","timestamp":1581292800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T00:00:00Z","timestamp":1581292800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s11036-019-01453-x","type":"journal-article","created":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T18:02:35Z","timestamp":1581357755000},"page":"1351-1363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Collaborative Thompson Sampling"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1021-1074","authenticated-orcid":false,"given":"Zhenyu","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liusheng","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongli","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,10]]},"reference":[{"key":"1453_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":"2","key":"1453_CR2","doi-asserted-by":"publisher","first-page":"5165","DOI":"10.1214\/17-EJS1341SI","volume":"11","author":"M Abeille","year":"2017","unstructured":"Abeille M, Lazaric A, et al. (2017) Linear thompson sampling revisited. Electron J Stat 11(2):5165\u20135197","journal-title":"Electron J Stat"},{"key":"1453_CR3","volume-title":"Handbook of mathematical functions with formulas, graphs and mathematical tables (applied mathematics series, vol 55","author":"M Abramowitz","year":"1964","unstructured":"Abramowitz M, Stegun IA (1964) Handbook of mathematical functions with formulas, graphs and mathematical tables (applied mathematics series, vol 55. National Bureau of Standards, Washington"},{"key":"1453_CR4","doi-asserted-by":"crossref","unstructured":"Agarwal D, Bo L, Traupman J, Xin D, Zhang L (2014) Laser: A scalable response prediction platform for online advertising. In: Proceedings of the 7th ACM international conference on Web search and data mining. ACM, pp 173\u2013182","DOI":"10.1145\/2556195.2556252"},{"key":"1453_CR5","unstructured":"Agrawal S, Goyal N (2012) Analysis of thompson sampling for the multi-armed bandit problem. In: Conference on learning theory, pp 39\u20131"},{"key":"1453_CR6","unstructured":"Agrawal S, Goyal N (2013) Thompson sampling for contextual bandits with linear payoffs. In: International conference on machine learning, pp 127\u2013135"},{"issue":"3","key":"1453_CR7","doi-asserted-by":"publisher","first-page":"357","DOI":"10.2748\/tmj\/1178243286","volume":"19","author":"K Azuma","year":"1967","unstructured":"Azuma K (1967) Weighted sums of certain dependent random variables. Tohoku Math J Sec Ser 19(3):357\u2013367","journal-title":"Tohoku Math J Sec Ser"},{"key":"1453_CR8","unstructured":"Bresler G, Chen GH, Shah D (2014) A latent source model for online collaborative filtering. In: Advances in neural information processing systems, pp 3347\u20133355"},{"key":"1453_CR9","doi-asserted-by":"crossref","unstructured":"Brod\u00e9n B, Hammar M, Nilsson BJ, Paraschakis D (2018) Ensemble recommendations via thompson sampling: an experimental study within e-commerce. In: 23Rd international conference on intelligent user interfaces. ACM, pp 19\u201329","DOI":"10.1145\/3172944.3172967"},{"key":"1453_CR10","unstructured":"Chapelle O, Li L (2011) An empirical evaluation of thompson sampling. In: Advances in neural information processing systems, pp 2249\u20132257"},{"key":"1453_CR11","doi-asserted-by":"crossref","unstructured":"Christakopoulou K, Banerjee A (2018) Learning to interact with users: A collaborative-bandit approach. In: Proceedings of the 2018 SIAM International Conference on Data Mining. SIAM, pp 612\u2013620","DOI":"10.1137\/1.9781611975321.69"},{"key":"1453_CR12","unstructured":"Chu W, Li L, Reyzin L, Schapire R (2011) Contextual bandits with linear payoff functions. In: Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, pp 208\u2013214"},{"key":"1453_CR13","doi-asserted-by":"crossref","unstructured":"Chu W, Park S-T, Beaupre T, Motgi N, Phadke A, Chakraborty S, Zachariah J (2009) A case study of behavior-driven conjoint analysis on yahoo!: front page today module. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 1097\u20131104","DOI":"10.1145\/1557019.1557138"},{"key":"1453_CR14","doi-asserted-by":"crossref","unstructured":"Ferreira K, Simchi-Levi D, Wang H (2017) Online network revenue management using thompson sampling","DOI":"10.1287\/opre.2018.1755"},{"issue":"3","key":"1453_CR15","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1038\/s41562-018-0297-4","volume":"2","author":"CM Glaze","year":"2018","unstructured":"Glaze CM, Filipowicz ALS, Kable JW, Balasubramanian V, Gold JI (2018) A bias\u2013variance trade-off governs individual differences in on-line learning in an unpredictable environment. Nat Hum Behav 2(3):213","journal-title":"Nat Hum Behav"},{"key":"1453_CR16","unstructured":"Gopalan A, Mannor S, Mansour Y (2014) Thompson sampling for complex online problems. In: International conference on machine learning, pp 100\u2013108"},{"key":"1453_CR17","unstructured":"Graepel T, Candela JQ, Borchert T, Herbrich R (2010) Web-scale bayesian click-through rate prediction for sponsored search advertising in microsoft\u2019s bing search engine. Omnipress"},{"issue":"301","key":"1453_CR18","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding W (1963) Probability inequalities for sums of bounded random variables. J Amer Stat Assoc 58 (301):13\u201330","journal-title":"J Amer Stat Assoc"},{"key":"1453_CR19","doi-asserted-by":"crossref","unstructured":"Kaufmann E, Korda N, Munos R (2012) Thompson sampling: An asymptotically optimal finite-time analysis. In: International conference on algorithmic learning theory. Springer, pp 199\u2013213","DOI":"10.1007\/978-3-642-34106-9_18"},{"key":"1453_CR20","unstructured":"Kawale J, Bui HH, Kveton B, Tran-Thanh L, Chawla S (2015) Efficient thompson sampling for online matrix-factorization recommendation. In: Advances in neural information processing systems, pp 1297\u20131305"},{"key":"1453_CR21","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.csda.2015.08.001","volume":"94","author":"F Lavancier","year":"2016","unstructured":"Lavancier F, Rochet P (2016) A general procedure to combine estimators. Comput Stat Data Anal 94:175\u2013192","journal-title":"Comput Stat Data Anal"},{"key":"1453_CR22","doi-asserted-by":"crossref","unstructured":"Li L, Chu W, Langford J, Schapire RE (2010) A contextual-bandit approach to personalized news article recommendation. In: Proceedings of the 19th international conference on World wide web. ACM, pp 661\u2013670","DOI":"10.1145\/1772690.1772758"},{"key":"1453_CR23","doi-asserted-by":"crossref","unstructured":"Li S, Karatzoglou A, Gentile C (2016) Collaborative filtering bandits. In: Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval. ACM, pp 539\u2013548","DOI":"10.1145\/2911451.2911548"},{"key":"1453_CR24","unstructured":"Nguyen TT, Lauw HW (2014) Dynamic clustering of contextual multi-armed bandits. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management. ACM, pp 1959\u20131962"},{"key":"1453_CR25","unstructured":"Yi O, Gagrani M, Nayyar A, Jain R (2017) Learning unknown markov decision processes: A thompson sampling approach. In: Advances in neural information processing systems, pp 1333\u20131342"},{"issue":"1","key":"1453_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000070","volume":"11","author":"DJ Russo","year":"2018","unstructured":"Russo DJ, Van Roy B, Kazerouni A, Osband I, Wen Z, et al. (2018) A tutorial on thompson sampling. Found Trends\u00ae; Mach Learn 11(1):1\u201396","journal-title":"Found Trends\u00ae; Mach Learn"},{"issue":"4","key":"1453_CR27","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1287\/mksc.2016.1023","volume":"36","author":"EM Schwartz","year":"2017","unstructured":"Schwartz EM, Bradlow ET, Fader PS (2017) Customer acquisition via display advertising using multi-armed bandit experiments. Mark Sci 36(4):500\u2013522","journal-title":"Mark Sci"},{"issue":"6","key":"1453_CR28","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1002\/asmb.874","volume":"26","author":"SL Scott","year":"2010","unstructured":"Scott SL (2010) A modern bayesian look at the multi-armed bandit. Appl Stoch Model Bus Ind 26(6):639\u2013658","journal-title":"Appl Stoch Model Bus Ind"},{"issue":"3\/4","key":"1453_CR29","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2307\/2332286","volume":"25","author":"WR Thompson","year":"1933","unstructured":"Thompson WR (1933) On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika 25(3\/4):285\u2013294","journal-title":"Biometrika"},{"issue":"4","key":"1453_CR30","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1093\/biomet\/80.4.791","volume":"80","author":"R Wolfinger","year":"1993","unstructured":"Wolfinger R (1993) Laplace\u2019s approximation for nonlinear mixed models. Biometrika 80(4):791\u2013795","journal-title":"Biometrika"},{"key":"1453_CR31","doi-asserted-by":"crossref","unstructured":"Wu Q, Wang H, Gu Q, Wang H (2016) Contextual bandits in a collaborative environment. In: Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval. ACM, pp 529\u2013538","DOI":"10.1145\/2911451.2911528"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-019-01453-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11036-019-01453-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-019-01453-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T00:22:10Z","timestamp":1612916530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11036-019-01453-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,10]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["1453"],"URL":"https:\/\/doi.org\/10.1007\/s11036-019-01453-x","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"type":"print","value":"1383-469X"},{"type":"electronic","value":"1572-8153"}],"subject":[],"published":{"date-parts":[[2020,2,10]]},"assertion":[{"value":"10 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}