IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v73y2025i1p461-482.html
   My bibliography  Save this article

The When and How of Delegated Search

Author

Listed:
  • Saša Zorc

    (Darden School of Business, University of Virginia, Charlottesville, Virginia 22903)

  • Ilia Tsetlin

    (Department of Decision Sciences, INSEAD, Singapore 138676)

  • Sameer Hasija

    (Department of Technology and Operations Management, INSEAD, 77305 Fontainebleau, France)

  • Stephen E. Chick

    (Department of Technology and Operations Management, INSEAD, 77305 Fontainebleau, France)

Abstract

Firms often outsource search processes, such as the acquisition of real estate, new technologies, or talent. To ensure the efficacy of such delegated search, firms need to carefully design incentive contracts to attenuate the ill effects of agency issues. We model this problem using a dynamic principal-agent framework, embedding the standard sequential search model. The optimal contract pays the agent a fixed per-period fee plus a bonus for finding a suitable alternative. The bonus size is defined a priori and decreases over time, whereas the range of values deemed suitable expands over time. If the principal is unable to contract on the value of the delivered alternatives, the optimal contract consists of two parts. Early in the search process, the agent is granted a small bonus for every alternative brought to the principal, irrespective of whether the principal accepts it; late in the search process, the agent is awarded a comparatively larger bonus, which is decreasing in time, but only if the principal accepts the alternative. We also consider situations where the principal chooses between searching in house and outsourcing. This decision is shown to hinge on the principal’s trade-off between speed and quality. The age-old aphorism “if you want it done right, do it yourself” holds, as in-house search is optimal for a principal who prioritizes quality. Yet, in the context of our model, we also establish an addendum: “If you want it done fast, hire someone else to do it.”

Suggested Citation

  • Saša Zorc & Ilia Tsetlin & Sameer Hasija & Stephen E. Chick, 2025. "The When and How of Delegated Search," Operations Research, INFORMS, vol. 73(1), pages 461-482, January.
  • Handle: RePEc:inm:oropre:v:73:y:2025:i:1:p:461-482
    DOI: 10.1287/opre.2019.0498
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2019.0498
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2019.0498?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:oropre:v:73:y:2025:i:1:p:461-482. 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.