IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2606.10438.html

Sequential Search with Planning

Author

Listed:
  • Ruhi Sonal
  • Saptarshi Mukherjee
  • Abhinaba Lahiri
  • Aniruddha Ghosh

Abstract

Sequential development of a new product or technology, or natural resource exploration, often progresses through ordered stages with uncertain rewards and requires costly (ex ante) planning to make future stages accessible. We model this process as an ordered Pandora's box problem where a decision-maker first chooses an initial scope, paying a cost that rises with the number of stages made accessible, and may later expand the scope at a marginal adjustment cost. Since the paid planning costs are sunk, the continuation values depend on the state variable ``paid scope''. We prove existence and uniqueness of scope-dependent reservation values, characterize the optimal search strategy as a threshold rule indexed by paid scope, and derive comparative statics. Interactions among three economic forces shape the optimal behavior -- a guarantee effect (a higher current best offer reduces the expected improvement from the next stage and induces earlier stopping), a paid-scope effect (a larger prepaid scope lowers the marginal cost of future access, raises the continuation value, and supports continuation at higher guarantees), and a remaining-horizon effect (fewer stages remaining shrink the option value of continuing). Two examples illustrate how these forces generate distinct planning and search patterns under normal and fat-tailed rewards.

Suggested Citation

  • Ruhi Sonal & Saptarshi Mukherjee & Abhinaba Lahiri & Aniruddha Ghosh, 2026. "Sequential Search with Planning," Papers 2606.10438, arXiv.org.
  • Handle: RePEc:arx:papers:2606.10438
    as

    Download full text from publisher

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