Uncertain Search with Knowledge Transfer

We consider a sequential search over a group of similar alternatives. The individual value of an alternative contains two components: an observable utility and an idiosyncratic value. Observable utilities share an unknown population distribution, which captures the similarity across the alternatives and allows for knowledge transfer within the group. Once a decision maker encounters an alternative, its utility is revealed immediately, whereas the idiosyncratic value is unobservable and needs to be learned by sampling. The goal is to select an alternative with the highest individual value, accounting for the sampling and search costs. A novel feature of this problem is the combination of the individual and population levels of learning. We formulate the problem as a Bayesian dynamic program and characterize the optimal policy by a threshold structure. We show that it depends on the difference between the mean estimates of the current alternative and the population. It is optimal to continue sampling if the difference is between a threshold pair; otherwise, accept the current alternative if it exceeds the upper threshold, and switch to a new one if it is below the lower threshold. Other structural properties are also derived to shed light on the effects of the two levels of learning. A key insight is that more uncertainty is preferable at the individual level, but less uncertainty is preferable at the population level. Various practical variants of the problem are also considered. This paper was accepted by Ilia Tsetlin, behavioral economics and decision analysis. Funding: W. T. Huh acknowledges support from the NSERC Discovery Grants (RGPIN 2020-04213) and the Canada Research Chair Program. The work of M. J. Kim was supported by the Natural Sciences and Engineering Research Council of Canada [NSERC Discovery Grant RGPIN-2024-05213]. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2023.00309 .

• 저널Management Science · 72(2) · 874–892
• 토픽Optimization and Search Problems · Computer Networks and Communications
• DOI10.1287/mnsc.2023.00309
• 저자Woonghee Tim Huh, Michael Jong Kim, Mei-Chun Lin