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

Chasing Contests

Author

Listed:
  • Zhuo Chen
  • Yun Liu

Abstract

This paper proposes a dynamic research contest, namely the chasing contest, in which two asymmetric contestants exert costly effort to accomplish two breakthroughs in a continuous-time framework. The contestants are asymmetric in that one of them is present-biased and has already achieved one breakthrough (the leader), while the other is time-consistent and needs to achieve two breakthroughs to win (the chaser). The principal can choose between two disclosure policies, which either immediately announces the first breakthrough of the chaser (public chasing contest), or only announces the contest results until its terminus (hidden chasing contest). We fully characterize the unique x-start and y-stop equilibrium of the chasing contest with the two disclosure policies, in which the leader starts working from an instant x to the end while the chaser stops exerting effort by the instant y. We further compare the asymmetric incentives of the two disclosure policies. Our results imply that the chaser will never stop earlier in the hidden chasing contest compared to its public chasing counterpart, whereas the leader works longer in the public chasing contest only if the contest permits a late deadline.

Suggested Citation

  • Zhuo Chen & Yun Liu, 2024. "Chasing Contests," Papers 2404.02756, arXiv.org.
  • Handle: RePEc:arx:papers:2404.02756
    as

    Download full text from publisher

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

    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:arx:papers:2404.02756. 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: 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.