🤖 AI Summary
This paper introduces, for the first time within the Pandora’s Box framework, the minimax *ex post* regret criterion to study sequential search and stopping strategies under uncertainty. Methodologically, it integrates robust optimization, regret theory, and sequential decision analysis to rigorously characterize the optimal search depth, ranking order of options, and stopping threshold. The contributions are threefold: (1) It theoretically establishes a “choice overload” phenomenon—increasing the number of options systematically raises the probability of abandoning search in favor of an outside option; (2) It identifies the root cause as fear of making a *wrong choice*, rather than cognitive load; (3) It proposes two intervention mechanisms—recommendation-based signal design and heterogeneity in search cost—that significantly reduce worst-case regret and incentivize efficient exploration. These results offer a novel paradigm bridging behavioral decision theory and mechanism design.
📝 Abstract
This paper revisits the classic Pandora's box problem, studying a decision-maker (DM) who seeks to minimize her maximal ex-post regret. The DM decides how many options to explore and in what order, before choosing one or taking an outside option. We characterize the regret-minimizing search rule and show that the likelihood of opting out often increases as more options become available for exploration. We show that this ``choice overload" is driven by the DM's fear of ``selection error" -- the regret from searching the wrong options -- suggesting that steering choice via recommendations or cost heterogeneity can mitigate regret and encourage search.