PPAR: A Privacy-Preserving Adaptive Ranking Algorithm for Multi-Armed-Bandit Crowdsourcing

Abstract

This paper studies the privacy-preserving adaptive ranking problem for multi-armed-bandit crowdsourcing, where according to the crowdsourced data, the arms are required to be ranked with a tunable granularity by the untrustworthy third-party platform. Any online worker can provide its data by arm pulls but requires its privacy preserved, which will increase the ranking cost greatly. To improve the quality of the ranking service, we propose a Privacy- Preserving Adaptive Ranking algorithm called PPAR, which can solve the problem with a high probability while differential privacy can be ensured. The total cost of the proposed algorithm is ${\mathcal{O}}(K\ln K)$, which is near optimal compared with the trivial lower bound Ω(K), where K is the number of arms. Our proposed algorithm can also be used to solve the well-studied fully ranking problem and the best arm identification problem, by proper setting the granularity parameter. For the fully ranking problem, PPAR attains the same order of computation complexity with the best-known results without privacy preservation. The efficacy of our algorithm is also verified by extensive experiments on public datasets.