{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T18:27:42Z","timestamp":1772303262352,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1109\/glocom.2017.8254592","type":"proceedings-article","created":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T17:50:54Z","timestamp":1516038654000},"page":"1-6","source":"Crossref","is-referenced-by-count":6,"title":["Bandit User Selection Algorithm for Budgeted and Time-Limited Mobile Crowdsensing"],"prefix":"10.1109","author":[{"given":"Shuo","family":"Yang","sequence":"first","affiliation":[]},{"given":"Xiaotian","family":"Qi","sequence":"additional","affiliation":[]},{"given":"Fan","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Xiaofeng","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Guihai","family":"Chen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref11","article-title":"Optimal regret analysis of thompson sampling in stochastic multi-armed bandit problem with multiple plays","author":"komiyama","year":"2015","journal-title":"ICML"},{"key":"ref12","first-page":"1","article-title":"Combinatorial multi-armed bandit and its extension to probabilistically triggered arms","volume":"17","author":"chen","year":"2016","journal-title":"Journal of Machine Learning Research"},{"key":"ref13","article-title":"Se-lecting most informative contributors with unknown costs for budgeted crowdsensing","author":"yang","year":"2016","journal-title":"IWQoS"},{"key":"ref14","article-title":"Budgeted multi-armed bandits with multiple plays","author":"xia","year":"2016","journal-title":"IJCAI"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1791212.1791239"},{"key":"ref16","author":"tran-thanh","year":"2012","journal-title":"Knapsack Based Optimal Policies for Budget-Limited Multi-Armed Bandits"},{"key":"ref4","article-title":"A truthful budget feasible multi-armed bandit mechanism for crowdsourcing time critical tasks","author":"biswas","year":"2015","journal-title":"AAMAS"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.04.005"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2014.6990395"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2017.2676898"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848053"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2348543.2348567"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2010.5560598"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5110-1_13"}],"event":{"name":"2017 IEEE Global Communications Conference (GLOBECOM 2017)","location":"Singapore","start":{"date-parts":[[2017,12,4]]},"end":{"date-parts":[[2017,12,8]]}},"container-title":["GLOBECOM 2017 - 2017 IEEE Global Communications Conference"],"original-title":[],"link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx7\/8253768\/8253909\/08254592.pdf?arnumber=8254592","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,19]],"date-time":"2018-02-19T19:13:54Z","timestamp":1519067634000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/ieeexplore.ieee.org\/document\/8254592\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":16,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/glocom.2017.8254592","relation":{},"subject":[],"published":{"date-parts":[[2017,12]]}}}