arXiv · 2504.17948
Robust Contracting for Sequential Search
Abstract
A principal contracts with an agent who sequentially searches over projects to generate a prize. The principal is unaware of the agent's full set of projects and evaluates a contract by its worst-case performance. We characterize the principal's robustly optimal contracts, which are all debt-like: the agent is paid only when the prize exceeds a threshold. Debt is optimal because it preserves the agent's incentive to continue exploring, discouraging the agent from settling down for cheap, safe alternatives. Our predictions map to contracts used to incentivize innovation in practice.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Théo Durandard, Udayan Vaidya, Boli Xu. 2026-09-15. Robust Contracting for Sequential Search. https://arxiv.org/abs/2504.17948
Cite the original work for its findings. Save a collection to share your selection of sources.