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

Tournaments with a Standard

Author

Listed:
  • Mikhail Drugov
  • Dmitry Ryvkin
  • Jun Zhang

Abstract

We study tournaments where winning a rank-dependent prize requires passing a minimum performance standard. We show that, for any prize allocation, the optimal standard is always at a mode of performance that is weakly higher than the global mode and identify a necessary and sufficient condition for it to be at the global mode. When the prize scheme can be designed as well, the winner-take-all prize scheme is optimal for noise distributions with an increasing failure rate; and awarding equal prizes to all qualifying agents is optimal for noise distributions with a decreasing failure rate. For distributions with monotone likelihood ratios -- log-concave and log-convex, respectively -- these pay schemes are also optimal in a larger class of anonymous, monotone contracts that may depend on cardinal performance.

Suggested Citation

  • Mikhail Drugov & Dmitry Ryvkin & Jun Zhang, 2024. "Tournaments with a Standard," Papers 2412.01139, arXiv.org.
  • Handle: RePEc:arx:papers:2412.01139
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2412.01139
    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:2412.01139. 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.