Nested Search
Abstract
This paper develops a model of nested search, in which information acquisition technology is represented by a tree. I explicitly construct an index for each node and prove the optimality of the corresponding index policy. The indexes connect the nested search problem to an auxiliary discrete choice problem that obtains the same final choice and expected payoff. I apply the framework to study drip pricing in a model of price competition with gradual consumer learning about product match values. I show that a regulation on drip pricing that makes early price quotes binding induces early disclosure of prices, lowers equilibrium prices and raises consumer surplus and social welfare. I also analyze how inspection costs and the relative importance of early and late signals for final payoffs shape the breadth and depth of optimal search. Payoff interactions between signals at different stages shape depth comparative statics, while breadth additionally depends on how marginal returns vary relative to signal hazard rates.