IDEAS home Printed from https://ideas.repec.org/a/bla/popmgt/v32y2023i11p3752-3772.html
   My bibliography  Save this article

Designing contests for data science competitions: Number of stages and the prize structures

Author

Listed:
  • Jialu Liu
  • Keehyung Kim

Abstract

Firms have been proactively holding data science competitions via online contest platforms to look for innovative solutions from the crowd. When firms are designing such competitions, a key question is “What should be a better contest design to motivate contestants to exert more effort?” We model two commonly observed contest structures (one stage and two stage) and two widely adopted prize structures (high spread and low spread). We employ economic experiments to examine how contest design affects contestants’ effort level. The results reject the base model with rationality assumption. We find that contestants exert significantly more effort in both the first stage and the second stage of the two‐stage contest. Moreover, it is better to assign most prizes to the winner in the two‐stage contest while it does not matter in one stage. To explain the empirical regularities, we develop a behavioral economics model that captures contestants’ psychological aversion to falling behind and continuous exertion of effort. Our findings demonstrate that it is important for contest organizers to account for the nonpecuniary factors that can influence contestants’ behavior in designing a competition.

Suggested Citation

  • Jialu Liu & Keehyung Kim, 2023. "Designing contests for data science competitions: Number of stages and the prize structures," Production and Operations Management, Production and Operations Management Society, vol. 32(11), pages 3752-3772, November.
  • Handle: RePEc:bla:popmgt:v:32:y:2023:i:11:p:3752-3772
    DOI: 10.1111/poms.14061
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/poms.14061
    Download Restriction: no

    File URL: https://libkey.io/10.1111/poms.14061?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    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:bla:popmgt:v:32:y:2023:i:11:p:3752-3772. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Wiley Content Delivery (email available below). General contact details of provider: http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1937-5956 .

    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.