We study sequential search without priors. Our interest lies in decision rules that are close to being optimal under each prior and after each history. We call these rules robust. The search literature employs optimal rules based on cutoff strategies, and these rules are not robust. We derive...

We consider a Bayesian persuasion problem where a sender's utility depends only on the expected state. We show that upper censorship that pools the states above a cutoff and reveals the states below the cutoff is optimal for all prior distributions of the state if and only if the sender's...

We study sequential search without priors. Our interest lies in decision rules that are close to being optimal under each prior and after each history. We call these rules robust. The search literature employs optimal rules based on cutoff strategies, and these rules are not robust. We derive...