Distributed Computing

, Volume 29, Issue 1, pp 1–16 | Cite as

Fair and resilient Incentive Tree mechanisms

  • Yuezhou Lv
  • Thomas Moscibroda


We study Incentive Trees for motivating the participation of people in crowdsourcing or human tasking systems. In an Incentive Tree, each participant is rewarded for contributing to the system, as well as for soliciting new participants into the system, who then themselves contribute to it and/or themselves solicit new participants. An Incentive Tree mechanism is an algorithm that determines how much reward each individual participant receives based on all the participants’ contributions, as well as the structure of the solicitation tree. The sum of rewards paid by the mechanism to all participants is linear in the sum of their total contribution. In this paper, we investigate the possibilities and limitations of Incentive Trees via an axiomatic approach by defining a set of desirable properties that an Incentive Tree mechanism should satisfy. We give a mutual incompatibility result showing that there is no Incentive Tree mechanism that simultaneously achieves all the properties. We then present two novel families of Incentive Tree mechanisms. The first family of mechanisms achieves all desirable properties, except that it fails to protect against a certain strong form of multi-identity attack; the second set of mechanisms achieves all properties, including the strong multi-identity protection, but fails to give participants the opportunity to achieve unbounded reward. Given the above impossibility result, these two mechanisms are effectively the best we can hope for. Finally, our model and results generalize recent studies on multi-level marketing mechanisms.


Multi-level marketing Crowdsourcing Incentive Trees Reward mechanisms 



This work was supported in part by the National Basic Research Program of China Grant 2011CBA00300, 2011CBA00302, the National Natural Science Foundation of China Grant 61033001, 61061130540, and the Hi-Tech research and Development Program of China Grant 2006AA10Z216.


  1. 1.
    Anderson, A., Huttenlocher, D., Kleinberg, J., Leskovec, J.: Steering user behavior with badges. In: Proceedings of the 22nd International Conference on World Wide Web (WWW), pp. 95–106. ACM (2013)Google Scholar
  2. 2.
    Babaioff, M., Dobzinski, S., Oren, S., Zohar, A.: On bitcoin and red balloons. In: Proceedings of the 13th ACM Conference on Electronic Commerce (EC), pp. 56–73. ACM (2012)Google Scholar
  3. 3.
    Cebrian, M., Coviello, L., Vattani, A., Voulgaris, P.: Finding red balloons with split contracts: robustness to individuals’ selfishness. In: Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC), pp. 775–788. ACM (2012)Google Scholar
  4. 4.
    Chen, W., Wang, Y., Yu, D., Zhang, L.: Sybil-proof mechanisms in query incentive networks. In: Proceedings of the 14th ACM Conference on Electronic Commerce (EC), pp. 197–214. ACM (2013)Google Scholar
  5. 5.
    Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 57–66. ACM (2001)Google Scholar
  6. 6.
    Douceur, JR: The sybil attack. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds.) Peer-to-Peer Systems, pp. 251–260. Springer (2002)Google Scholar
  7. 7.
    Douceur, J.R., Moscibroda, T.: Lottery trees: motivational deployment of networked systems. In: Proceedings of SIGCOMM, pp. 121–132. ACM (2007)Google Scholar
  8. 8.
    Drucker, F.A., Fleischer, L.K.: Simpler sybil-proof mechanisms for multi-level marketing. In: Proceedings of the 13th ACM Conference on Electronic Commerce (EC), pp. 441–458. ACM (2012)Google Scholar
  9. 9.
    Emek, Y., Karidi, R., Tennenholtz, M., Zohar, A.: Mechanisms for multi-level marketing. In: Proceedings of the 12th ACM Conference on Electronic Commerce (EC), pp. 209–218. ACM (2011)Google Scholar
  10. 10.
    Ghosh, A., McAfee, P.: Incentivizing high-quality user-generated content. In: Proceedings of the 20th International Conference on World Wide Web (WWW), pp. 137–146. ACM (2011)Google Scholar
  11. 11.
    Kleinberg, J., Raghavan, P.: Query incentive networks. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 132–141. IEEE (2005)Google Scholar
  12. 12.
    Lv, Y., Moscibroda, T.: Fair and resilient incentive tree mechanisms. In: Proceedings of the 32nd Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 230–239. ACM (2013)Google Scholar
  13. 13.
    Pickard, G., Pan, W., Rahwan, I., Cebrian, M., Crane, R., Madan, A., Pentland, A.: Time-critical social mobilization. Science 334(6055), 509–512 (2011)CrossRefGoogle Scholar
  14. 14.
    Rai, A., Chintalapudi, K.K., Padmanabhan, V.N., Sen, R.: Zee: zero-effort crowdsourcing for indoor localization. In: Proceedings of the 18th Annual International Conference on Mobile Computing and Networking (MobiCom), pp. 293–304. ACM (2012)Google Scholar
  15. 15.
    Tennenholtz, M.: Convention evolution in organizations and markets. Comput. Math. Organ. Theory 2(4), 261–283 (1996)CrossRefGoogle Scholar
  16. 16.
    Wagman, L., Conitzer, V.: Optimal false-name-proof voting rules with costly voting. In: AAAI, pp. 190–195 (2008)Google Scholar
  17. 17.
    Wang, H., Sen, S., Elgohary, A., Farid, M., Youssef, M., Choudhury, R.R.: No need to war-drive: unsupervised indoor localization. In: Proceedings of the 10th International Conference on Mobile Systems, Applications, and Services (MobiSys), pp. 197–210. ACM (2012)Google Scholar
  18. 18.
    Yang, D., Xue, G., Fang, X., Tang, J.: Crowdsourcing to smartphones: incentive mechanism design for mobile phone sensing. In: Proceedings of the 18th Annual International Conference on Mobile Computing and Networking (MobiCom), pp. 173–184. ACM (2012)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  1. 1.Institute for Interdisciplinary Information Sciences (IIIS)Tsinghua UniversityBeijingChina
  2. 2.Tsinghua UniversityBeijingChina
  3. 3.Microsoft Research (MSR)BeijingChina
  4. 4.BeijingChina

Personalised recommendations