Information Gathering With Peers: Submodular Optimization With Peer-Prediction Constraints

Authors

  • Goran Radanovic Harvard University
  • Adish Singla MPI-SWS
  • Andreas Krause ETH Zurich
  • Boi Faltings EPFL

Abstract

We study a problem of optimal information gathering from multiple data providers that need to be incentivized to provide accurate information. This problem arises in many real world applications that rely on crowdsourced data sets, but where the process of obtaining data is costly. A notable example of such a scenario is crowd sensing. To this end, we formulate the problem of optimal information gathering as maximization of a submodular function under a budget constraint, where the budget represents the total expected payment to data providers. Contrary to the existing approaches, we base our payments on incentives for accuracy and truthfulness, in particular, peer prediction methods that score each of the selected data providers against its best peer, while ensuring that the minimum expected payment is above a given threshold. We first show that the problem at hand is hard to approximate within a constant factor that is not dependent on the properties of the payment function. However, for given topological and analytical properties of the instance, we construct two greedy algorithms, respectively called PPCGreedy and PPCGreedyIter, and establish theoretical bounds on their performance w.r.t. the optimal solution. Finally, we evaluate our methods using a realistic crowd sensing testbed.

Downloads

Published

2018-04-25

How to Cite

Radanovic, G., Singla, A., Krause, A., & Faltings, B. (2018). Information Gathering With Peers: Submodular Optimization With Peer-Prediction Constraints. Proceedings of the AAAI Conference on Artificial Intelligence, 32(1). Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/11510

Issue

Section

AAAI Technical Track: Human-Computation and Crowd Sourcing