IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v70y2024i10p7265-7282.html
   My bibliography  Save this article

Contest Schemes and Dynamic Incentive Provision

Author

Listed:
  • Qintao Fan

    (School of Accounting, Lundquist School of Business, University of Oregon, Eugene, Oregon 97403)

  • Nicole Johnson

    (School of Accounting, Lundquist School of Business, University of Oregon, Eugene, Oregon 97403)

Abstract

Simple contest schemes, which tend to use extreme contemporaneous peer benchmarking, are generally thought to be less efficient at motivating productive and cooperative effort than explicit bonus contracts that optimally weight observed own and peer outputs. We show, however, that contest schemes can outperform explicit bonus contracts in a two-period dynamic setting if periodic output is correlated over time, and contract terms can be renegotiated. In our model, all parties update their beliefs about ex ante unknown time-invariant noise upon observing first-period outputs, and second-period wage offers are updated accordingly. This creates first-period shirking incentives for the agents. We show that relative to bonus contracts, the extreme contemporaneous peer benchmarking in contest schemes can weaken or even eliminate the adverse incentives created by prior-period benchmarking, even though the available information and the learning process are the same under both schemes. This dynamic advantage allows contest schemes to outperform repeated bonus contracts for a wide range of parameter values, despite imposing higher static efficiency losses in each period. If competing agents are assigned to sufficiently similar tasks, a contest scheme’s ability to sever the statistical link between periods can yield not only higher early productive effort compared with bonus contracts, but also less uncooperative behavior, despite putting the agents in a more contest-like situation.

Suggested Citation

  • Qintao Fan & Nicole Johnson, 2024. "Contest Schemes and Dynamic Incentive Provision," Management Science, INFORMS, vol. 70(10), pages 7265-7282, October.
  • Handle: RePEc:inm:ormnsc:v:70:y:2024:i:10:p:7265-7282
    DOI: 10.1287/mnsc.2022.00035
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.2022.00035
    Download Restriction: no

    File URL: https://libkey.io/10.1287/mnsc.2022.00035?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
    ---><---

    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:inm:ormnsc:v:70:y:2024:i:10:p:7265-7282. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.