Threats and trade-fffs in resource critical crowdsourcing tasks over networks

Dayama, Pankaj and Garg, Dinesh and Narahari, Y and Zou, James (2012) Threats and trade-fffs in resource critical crowdsourcing tasks over networks. In: AAAI 2012 (Poster) International Conference of the American Association for Artificial Intelligence, 2012, Toronto, Ontario.

PDF Ame_Asso_Arti_Inte_2447_2012.pdf - Published Version Restricted to Registered users only Download (319kB) | Request a copy

Abstract

In recent times, crowdsourcing over social networks has emerged as an active tool for complex task execution. In this paper, we address the problem faced by a planner to incen-tivize agents in the network to execute a task and also help in recruiting other agents for this purpose. We study this mecha-nism design problem under two natural resource optimization settings: (1) cost critical tasks, where the planner’s goal is to minimize the total cost, and (2) time critical tasks, where the goal is to minimize the total time elapsed before the task is executed. We define a set of fairness properties that should beideally satisfied by a crowdsourcing mechanism. We prove that no mechanism can satisfy all these properties simultane-ously. We relax some of these properties and define their ap-proximate counterparts. Under appropriate approximate fair-ness criteria, we obtain a non-trivial family of payment mech-anisms. Moreover, we provide precise characterizations of cost critical and time critical mechanisms.

Item Type:	Conference Paper
Publisher:	Association for the Advancement of Artificial Intelligence
Additional Information:	Copyright of this article belongs to Association for the Advancement of Artificial Intelligence.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	06 Nov 2013 06:14
Last Modified:	06 Nov 2013 06:14
URI:	http://eprints.iisc.ac.in/id/eprint/47717

Actions (login required)

View Item