Skip to Main Content
HBS Home
  • About
  • Academic Programs
  • Alumni
  • Faculty & Research
  • Baker Library
  • Giving
  • Harvard Business Review
  • Initiatives
  • News
  • Recruit
  • Map / Directions
Faculty & Research
  • Faculty
  • Research
  • Featured Topics
  • Academic Units
  • …→
  • Harvard Business School→
  • Faculty & Research→
Publications
Publications
  • Article
  • Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS)

The Price of Anarchy of Self-Selection in Tullock Contests

By: Hau Chan, David C. Parkes and Karim R. Lakhani
  • Format:Electronic
ShareBar

Abstract

Crowdsourcing platforms operate by offering their clients the ability to obtain cost-effective solutions for their problems through contests. The top contestants with the best solutions are rewarded, and the submitted solutions are provided to the clients. Within the platforms, the contestants can self-select which contest they compete in. In this paper, we measure crowdsourcing efficiency induces by the strategic behavior of contestants. We first propose a game-theoretic model of self-selection in Tullock contests (SSTC). To study the efficiency of SSTC, we establish the existence of a pure-strategy Nash equilibrium (PSNE). We then study the efficiency, via the price of anarchy (PoA), that comes from the worst-case equilibria of SSTC. We develop general efficiency PoA bounds with respect to PSNE, fully mixed NE, and general equilibrium concepts. For the case of identical contestants, we show that the pure and fully mixed PoA are one when the number of contestants is large—implying self-selection is efficient. In simulations, we show that an empirical bound well approximates the pure PoA, and the bound goes to one as the number of contestants becomes large.

Keywords

Crowdsourcing Contests; Game Theory

Citation

Chan, Hau, David C. Parkes, and Karim R. Lakhani. "The Price of Anarchy of Self-Selection in Tullock Contests." Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS) 19th (2020): 1795–1797.
  • Register to Read

About The Author

Karim R. Lakhani

Technology and Operations Management
→More Publications

More from the Authors

    • February 2021
    • Faculty Research

    Threadless: The Renewal of an Online Community

    By: Shane Greenstein, Karim Lakhani and Christian Godwin
    • 2021
    • Faculty Research

    Consuming Contests: Outcome Uncertainty and Spectator Demand for Contest-based Entertainment

    By: Patrick J. Ferguson and Karim R. Lakhani
    • 2020
    • Faculty Research

    Learning with People Like Me: The Role of Age-Similar Peers on Online Business Course Engagement

    By: Laura R. Huber, Jacqueline N. Lane and Karim R. Lakhani
More from the Authors
  • Threadless: The Renewal of an Online Community By: Shane Greenstein, Karim Lakhani and Christian Godwin
  • Consuming Contests: Outcome Uncertainty and Spectator Demand for Contest-based Entertainment By: Patrick J. Ferguson and Karim R. Lakhani
  • Learning with People Like Me: The Role of Age-Similar Peers on Online Business Course Engagement By: Laura R. Huber, Jacqueline N. Lane and Karim R. Lakhani
ǁ
Campus Map
Harvard Business School
Soldiers Field
Boston, MA 02163
→Map & Directions
→More Contact Information
  • Make a Gift
  • Site Map
  • Jobs
  • Harvard University
  • Trademarks
  • Policies
  • Digital Accessibility
Copyright © President & Fellows of Harvard College