.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
We describe a search problem in which a decision maker (DM) must select among sequentially encountered options. Each option is described by multiple attributes, and the value of an option is given by a separable function of its attribute values. However, the attribute values are not known with certainty, and can only be ascertained in a predefined order, at some fixed cost. During the search the DM can choose to select an option, purchase information about an attribute value, reject (permanently) the current option and continue the search, or terminate the search and accept a status quo outcome. We introduce a threshold policy for this search process, and prove the optimality of this policy for separable value functions. We then furnish a dynamic programming procedure for prescribing an optimal policy for this problem. Finally, we derive analytic solutions to some special cases of the problem, and present a case study that demonstrates a possible use of the proposed approach.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
暂无期刊信息
机构
暂无机构信息
引用论文
暂无论文信息