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

Robust Contracting for Sequential Search

Author

Listed:
  • Th'eo Durandard
  • Udayan Vaidya
  • Boli Xu

Abstract

A principal contracts with an agent who can sequentially search over projects to generate a prize. The principal knows only one of the agent's available projects and evaluates a contract by its worst-case performance. We characterize the set of robustly optimal contracts, all of which involve a minimum debt level, i.e., the agent only receives payment if the prize exceeds a certain threshold. This debt requirement is essential to prevent the agent from terminating the search too early. Our characterization encompasses several commonly observed contract formats, including pure debt, debt-plus-equity, and tranches. We also study situations where each of these contracts emerges as the unique prediction. In contrast to much of the existing robust contracting literature, linear contracts are strictly sub-optimal because they dampen the agent's search incentive.

Suggested Citation

  • Th'eo Durandard & Udayan Vaidya & Boli Xu, 2025. "Robust Contracting for Sequential Search," Papers 2504.17948, arXiv.org.
    • Handle: RePEc:arx:papers:2504.17948
    as

    Download full text from publisher

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