{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:13:34Z","timestamp":1771611214129,"version":"3.50.1"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:00:00Z","timestamp":1654819200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:00:00Z","timestamp":1654819200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100009108","name":"Shandong University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009108","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,10]]},"DOI":"10.1109\/iwqos54832.2022.9812914","type":"proceedings-article","created":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T19:27:44Z","timestamp":1657049264000},"page":"1-10","source":"Crossref","is-referenced-by-count":2,"title":["PPAR: A Privacy-Preserving Adaptive Ranking Algorithm for Multi-Armed-Bandit Crowdsourcing"],"prefix":"10.1109","author":[{"given":"Shuzhen","family":"Chen","sequence":"first","affiliation":[{"name":"Shandong University,School of Computer Science and Technology,China"}]},{"given":"Dongxiao","family":"Yu","sequence":"additional","affiliation":[{"name":"Shandong University,School of Computer Science and Technology,China"}]},{"given":"Feng","family":"Li","sequence":"additional","affiliation":[{"name":"Shandong University,School of Computer Science and Technology,China"}]},{"given":"Zongrui","family":"Zou","sequence":"additional","affiliation":[{"name":"Shandong University,School of Computer Science and Technology,China"}]},{"given":"Weifa","family":"Liang","sequence":"additional","affiliation":[{"name":"City University of Hong Kong,School of Computer Science,Hong Kong"}]},{"given":"Xiuzhen","family":"Cheng","sequence":"additional","affiliation":[{"name":"Shandong University,School of Computer Science and Technology,China"}]}],"member":"263","reference":[{"key":"ref32","article-title":"Large-scale open dataset, pipeline, and benchmark for bandit algorithms","author":"saito","year":"2020"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10212"},{"key":"ref10","first-page":"1757","article-title":"Locally Differentially Private Combinatorial Semi-Bandits","author":"chen","year":"2020","journal-title":"Proc of the 37th ICML"},{"key":"ref11","first-page":"4301","article-title":"Differentially Private Contextual Linear Bandits","author":"shariff","year":"2018","journal-title":"Proc of the 32rd NIPS"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79228-4_1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.v1i2.570"},{"key":"ref14","first-page":"405","article-title":"Private and continual release of statistics","author":"chan","year":"2010","journal-title":"Proc of ICALP"},{"key":"ref15","first-page":"535","article-title":"Towards Instance Optimal Bounds for Best Arm Identification","volume":"65","author":"chen","year":"2017","journal-title":"Proc of 30th COLT"},{"key":"ref16","first-page":"1238","article-title":"Almost Optimal Exploration in Multi-Armed Bandits","author":"karnin","year":"2013","journal-title":"Proc of the 30th ICML"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2020.101919"},{"key":"ref18","article-title":"Preference-based online learning with dueling bandits: A survey","volume":"22","author":"bengs","year":"2021","journal-title":"J Mach Learn Res"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2991000"},{"key":"ref28","first-page":"2820","article-title":"Exploring k out of Top ? Fraction of Arms in Stochastic Bandits","author":"ren","year":"2019","journal-title":"Proc of the 22nd AISTATS"},{"key":"ref4","first-page":"1839","article-title":"Adaptive Sampling for Coarse Ranking","volume":"84","author":"katariya","year":"2018","journal-title":"Proc of the 21th AISTATS"},{"key":"ref27","first-page":"101","article-title":"Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection","author":"chen","year":"2017","journal-title":"Proc of the 20th AISTATS"},{"key":"ref3","first-page":"11 045","article-title":"MaxGap Bandit: Adaptive Algorithms for Approximate Ranking","author":"katariya","year":"2019","journal-title":"Proc of the 33rd NIPS"},{"key":"ref6","first-page":"1669","article-title":"Is This Thing On?: Crowd-sourcing Privacy Indicators for Ubiquitous Sensing Platforms","author":"egelman","year":"2015","journal-title":"Proc of the 33rd ACM CHI"},{"key":"ref29","article-title":"Top-k extreme contextual bandits with arm hierarchy","author":"sen","year":"2021","journal-title":"CoRR"},{"key":"ref5","article-title":"Batched Coarse Ranking in Multi-Armed Bandits","volume":"33","author":"karpov","year":"2020","journal-title":"Proc of the 34th NIPS"},{"key":"ref8","article-title":"Differentially-Private Federated Linear Bandits","author":"dubey","year":"2020","journal-title":"Proc of 34th NIPS"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.accfor.2013.06.001"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1080\/08839514.2021.1881297"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3383313.3412254"},{"key":"ref1","article-title":"Large scale analysis of open MOOC reviews to support learners’ course selection","author":"gomez","year":"2022","journal-title":"CoRR"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2021.104474"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/PASSAT\/SocialCom.2011.203"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2021.11.004"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3015986"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.001.1900280"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2020.3010833"}],"event":{"name":"2022 IEEE\/ACM 30th International Symposium on Quality of Service (IWQoS)","location":"Oslo, Norway","start":{"date-parts":[[2022,6,10]]},"end":{"date-parts":[[2022,6,12]]}},"container-title":["2022 IEEE\/ACM 30th International Symposium on Quality of Service (IWQoS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9812862\/9812863\/09812914.pdf?arnumber=9812914","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T00:44:46Z","timestamp":1659660286000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9812914\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,10]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/iwqos54832.2022.9812914","relation":{},"subject":[],"published":{"date-parts":[[2022,6,10]]}}}