This paper develops a tractable framework for analyzing compound search problems, where a searcher chooses search intensity adaptively in each period. We fully characterize the optimal search rule and value, decomposing the inter-temporal change of search intensity into the fall-back value...

A seller wants to allocate an indivisible product among a number of potential bidders by a finite deadline, and to contact a bidder, she needs to incur a search cost. We show that the seller's optimal search outcomes can be implemented by a sequential search auction, which is characterized by...