Before revision:  En route, we improve the sample complexity bound, recently obtained by Guo et al. ( 2019 ), for the Pandora's Box problem, which is a classical model for sequential consumer search.
After revision:  En route, we improve the sample complexity bound, recently obtained by Guo et al. ( 2020 ), for the Pandora's Box problem, which is a classical model for sequential consumer search.