Abstract
An exciting application of crowdsourcing is to use social networks in complex task execution. In this paper, we address the problem of a planner who needs to incentivize agents within a network in order to seek their help in executing an atomic task as well as in recruiting other agents to execute the task. We study this mechanism 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 identify a set of desirable properties that should ideally be satisfied by a crowdsourcing mechanism. In particular, sybil-proofness and collapse-proofness are two complementary properties in our desiderata. We prove that no mechanism can satisfy all the desirable properties simultaneously. This leads us naturally to explore approximate versions of the critical properties. We focus our attention on approximate sybil-proofness and our exploration leads to a parametrized family of payment mechanisms which satisfy collapse-proofness. We characterize the approximate versions of the desirable properties in cost critical and time critical domain.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Babaioff, M., Dobzinski, S., Oren, S., Zohar, A.: On Bitcoin and Red Balloons. In: Proceedings of ACM Electronic Commerce (2012)
Conitzer, V., Immorlica, N., Letchford, J., Munagala, K., Wagman, L.: False-Name-Proofness in Social Networks. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 209–221. Springer, Heidelberg (2010)
DARPA: DARPA Network Challenge Project Report (2010), http://archive.darpa.mil/networkchallenge/
DARPA: DARPA CLIQR Quest Challenge (2012)
Drucker, F., Fleischer, L.: Simple Sybil-Proof Mechanisms for Multi-Level Marketing. In: Proceedings of ACM Electronic Commerce (2012)
Emek, Y., Karidi, R., Tennenholtz, M., Zohar, A.: Mechanisms for Multi-Level Marketing. In: Proceedings of the 12th ACM Conference on Electronic Commerce, EC (2011)
Howe, J.: Crowdsourcing: Why the Power of the Crowd Is Driving the Future of Business. Crown Business (2009)
Kleinberg, J., Raghavan, P.: Query Incentive Networks. In: Proceedings 46th IEEE Symposium on Foundations of Computer Science, pp. 132–141 (2005)
Pickard, G., Pan, W., Rahwan, I., Cebrian, M., Crane, R., Madan, A., Pentland, A.: Time-Critical Social Mobilization. Science 334(6055), 509–512 (2011)
Surowiecki, J.: The Wisdom of Crowds. Anchor (2005)
Yu, H., Kaminsky, M., Gibbons, P.B., Flaxman, A.: SybilGuard: Defending against Sybil attacks via Social Networks. SIGCOMM Comput. Commun. Rev. 36, 267–278 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nath, S., Dayama, P., Garg, D., Narahari, Y., Zou, J. (2012). Mechanism Design for Time Critical and Cost Critical Task Execution via Crowdsourcing. In: Goldberg, P.W. (eds) Internet and Network Economics. WINE 2012. Lecture Notes in Computer Science, vol 7695. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35311-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-35311-6_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35310-9
Online ISBN: 978-3-642-35311-6
eBook Packages: Computer ScienceComputer Science (R0)