Abstract

We revisit the sequential search problem by Hey. In a 2 ×\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\times $$\end{document} 2 factorial design, varying fixed and random cost treatments with and without recall, we address open research questions that were originally stated by Hey. Our results provide clear evidence for Hey’s conjecture that recall negatively affects performance in sequential search. With experience, however, search behavior with and without recall converges toward the optimal reservation rule. We further find that the utilization of optimal reservation rules is independent from the stochastic nature of the search cost.