IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2112.02884.html
   My bibliography  Save this paper

Social Sourcing: Incorporating Social Networks Into Crowdsourcing Contest Design

Author

Listed:
  • Qi Shi
  • Dong Hao

Abstract

In a crowdsourcing contest, a principal holding a task posts it to a crowd. People in the crowd then compete with each other to win the rewards. Although in real life, a crowd is usually networked and people influence each other via social ties, existing crowdsourcing contest theories do not aim to answer how interpersonal relationships influence people's incentives and behaviors and thereby affect the crowdsourcing performance. In this work, we novelly take people's social ties as a key factor in the modeling and designing of agents' incentives in crowdsourcing contests. We establish two contest mechanisms by which the principal can impel the agents to invite their neighbors to contribute to the task. The first mechanism has a symmetric Bayesian Nash equilibrium, and it is very simple for agents to play and easy for the principal to predict the contest performance. The second mechanism has an asymmetric Bayesian Nash equilibrium, and agents' behaviors in equilibrium show a vast diversity which is strongly related to their social relations. The Bayesian Nash equilibrium analysis of these new mechanisms reveals that, besides agents' intrinsic abilities, the social relations among them also play a central role in decision-making. Moreover, we design an effective algorithm to automatically compute the Bayesian Nash equilibrium of the invitation crowdsourcing contest and further adapt it to a large graph dataset. Both theoretical and empirical results show that the new invitation crowdsourcing contests can substantially enlarge the number of participants, whereby the principal can obtain significantly better solutions without a large advertisement expenditure.

Suggested Citation

  • Qi Shi & Dong Hao, 2021. "Social Sourcing: Incorporating Social Networks Into Crowdsourcing Contest Design," Papers 2112.02884, arXiv.org, revised Nov 2022.
  • Handle: RePEc:arx:papers:2112.02884
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2112.02884
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Lazear, Edward P & Rosen, Sherwin, 1981. "Rank-Order Tournaments as Optimum Labor Contracts," Journal of Political Economy, University of Chicago Press, vol. 89(5), pages 841-864, October.
    2. Olszewski, Wojciech & Siegel, Ron, 2020. "Performance-maximizing large contests," Theoretical Economics, Econometric Society, vol. 15(1), January.
    3. Yeon-Koo Che & Ian Gale, 2003. "Optimal Design of Research Contests," American Economic Review, American Economic Association, vol. 93(3), pages 646-671, June.
    4. Krueger, Anne O, 1974. "The Political Economy of the Rent-Seeking Society," American Economic Review, American Economic Association, vol. 64(3), pages 291-303, June.
    5. Dasgupta, Ani & Nti, Kofi O., 1998. "Designing an optimal contest," European Journal of Political Economy, Elsevier, vol. 14(4), pages 587-603, November.
    6. Qiang Fu & Jingfeng Lu, 2012. "The optimal multi-stage contest," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 51(2), pages 351-382, October.
    7. Fu, Qiang & Wu, Zenan, 2020. "On the optimal design of biased contests," Theoretical Economics, Econometric Society, vol. 15(4), November.
    8. Chawla, Shuchi & Hartline, Jason D. & Sivan, Balasubramanian, 2019. "Optimal crowdsourcing contests," Games and Economic Behavior, Elsevier, vol. 113(C), pages 80-96.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Roman M. Sheremeta, 2011. "Contest Design: An Experimental Investigation," Economic Inquiry, Western Economic Association International, vol. 49(2), pages 573-590, April.
    2. Subhasish M. Chowdhury & Patricia Esteve‐González & Anwesha Mukherjee, 2023. "Heterogeneity, leveling the playing field, and affirmative action in contests," Southern Economic Journal, John Wiley & Sons, vol. 89(3), pages 924-974, January.
    3. Letina, Igor & Liu, Shuo & Netzer, Nick, 2023. "Optimal contest design: Tuning the heat," Journal of Economic Theory, Elsevier, vol. 213(C).
    4. Fu, Qiang & Wang, Xiruo & Wu, Zenan, 2021. "Multi-prize contests with risk-averse players," Games and Economic Behavior, Elsevier, vol. 129(C), pages 513-535.
    5. Cason, Timothy N. & Masters, William A. & Sheremeta, Roman M., 2020. "Winner-take-all and proportional-prize contests: Theory and experimental results," Journal of Economic Behavior & Organization, Elsevier, vol. 175(C), pages 314-327.
    6. Zhuoqiong Chen, 2021. "All-pay auctions with private signals about opponents’ values," Review of Economic Design, Springer;Society for Economic Design, vol. 25(1), pages 33-64, June.
    7. Sheremeta, Roman, 2009. "Essays on Experimental Investigation of Lottery Contests," MPRA Paper 49888, University Library of Munich, Germany.
    8. Lian Jian & Zheng Li & Tracy Xiao Liu, 2017. "Simultaneous versus sequential all-pay auctions: an experimental study," Experimental Economics, Springer;Economic Science Association, vol. 20(3), pages 648-669, September.
    9. Noam Cohen & Guy Maor & Aner Sela, 2018. "Two-stage elimination contests with optimal head starts," Review of Economic Design, Springer;Society for Economic Design, vol. 22(3), pages 177-192, December.
    10. Toomas Hinnosaar, 2016. "Dynamic common-value contests," Carlo Alberto Notebooks 479, Collegio Carlo Alberto.
    11. Cason, Timothy N. & Masters, William A. & Sheremeta, Roman M., 2010. "Entry into winner-take-all and proportional-prize contests: An experimental study," Journal of Public Economics, Elsevier, vol. 94(9-10), pages 604-611, October.
    12. Yizhaq Minchuk & Aner Sela, 2021. "Subsidy and Taxation in All-Pay Auctions under Incomplete," Working Papers 2104, Ben-Gurion University of the Negev, Department of Economics.
    13. Ratul Lahkar & Saptarshi Mukherjee, 2022. "Optimal Large Population Tullock Contests," Working Papers 82, Ashoka University, Department of Economics.
    14. Zhu, Feng, 2021. "On optimal favoritism in all-pay contests," Journal of Mathematical Economics, Elsevier, vol. 95(C).
    15. Alice Guerra & Barbara Luppi & Francesco Parisi, 2019. "Productive and unproductive competition: a unified framework," Economia Politica: Journal of Analytical and Institutional Economics, Springer;Fondazione Edison, vol. 36(3), pages 785-804, October.
    16. Mengxi Zhang, 2023. "Optimal Contests with Incomplete Information and Convex Effort Costs," CRC TR 224 Discussion Paper Series crctr224_2023_156v2, University of Bonn and University of Mannheim, Germany.
    17. Emmanuel Dechenaux & Dan Kovenock & Roman Sheremeta, 2015. "A survey of experimental research on contests, all-pay auctions and tournaments," Experimental Economics, Springer;Economic Science Association, vol. 18(4), pages 609-669, December.
    18. Beviá, Carmen & Corchón, Luis C., 2013. "Endogenous strength in conflicts," International Journal of Industrial Organization, Elsevier, vol. 31(3), pages 297-306.
    19. Pavel Kireyev, 2016. "Markets for Ideas: Prize Structure, Entry Limits, and the Design of Ideation Contests," Harvard Business School Working Papers 16-129, Harvard Business School.
    20. Sami Dakhlia & Paul Pecorino, 2006. "Rent-seeking with scarce talent: A model of preemptive hiring," Public Choice, Springer, vol. 129(3), pages 475-486, December.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2112.02884. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.