IDEAS home Printed from https://ideas.repec.org/a/wly/iecrev/v60y2019i3p1063-1096.html
   My bibliography  Save this article

Enhancing Effort Supply With Prize‐Augmenting Entry Fees: Theory And Experiments

Author

Listed:
  • Robert G. Hammond
  • Bin Liu
  • Jingfeng Lu
  • Yohanes E. Riyanto

Abstract

Entry fees are widely observed in contests. We study the effect of a prize‐augmenting entry fee on expected total effort in an all‐pay auction setting where the contestants' abilities are private information. An entry fee reduces equilibrium entry but can enhance the entrants' effort supply. Our theoretical model demonstrates that the optimal entry fee is strictly positive and finite. In a laboratory experiment, we empirically test the effect of entry fees on effort supply. Our results provide strong support for the notion that a principal can elicit higher effort using an appropriately set entry fee to augment the prize purse.

Suggested Citation

  • Robert G. Hammond & Bin Liu & Jingfeng Lu & Yohanes E. Riyanto, 2019. "Enhancing Effort Supply With Prize‐Augmenting Entry Fees: Theory And Experiments," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 60(3), pages 1063-1096, August.
  • Handle: RePEc:wly:iecrev:v:60:y:2019:i:3:p:1063-1096
    DOI: 10.1111/iere.12379
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/iere.12379
    Download Restriction: no

    File URL: https://libkey.io/10.1111/iere.12379?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Luke Boosey & Philip Brookins & Dmitry Ryvkin, 2020. "Entry in group contests," Working Papers wp2020_02_01, Department of Economics, Florida State University.
    2. Liu, Bin & Lu, Jingfeng, 2023. "Optimal orchestration of rewards and punishments in rank-order contests," Journal of Economic Theory, Elsevier, vol. 208(C).
    3. Liu, Bin & Lu, Jingfeng, 2019. "The optimal allocation of prizes in contests with costly entry," International Journal of Industrial Organization, Elsevier, vol. 66(C), pages 137-161.
    4. Jiao, Qian & Ke, Changxia & Liu, Yang, 2022. "When to disclose the number of contestants: Theory and experimental evidence," Journal of Economic Behavior & Organization, Elsevier, vol. 193(C), pages 146-160.

    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:wly:iecrev:v:60:y:2019:i:3:p:1063-1096. 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: https://edirc.repec.org/data/deupaus.html .

    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.