最优序列搜索的排序表示
A Ranking Representation of Optimal Sequential Search
AI总结:
本文提出一种基于排序的最优序列搜索表示,通过理论等价性证明在独立性和不变性假设下,序列搜索过程最优当且仅当存在所有可行动作的排序。该方法简化了模型实现,提高了计算效率和准确性。
摘要:
序列搜索模型为研究消费者搜索行为提供了强大的框架,利用记录搜索过程中消费者行动序列的丰富数据。现有实证应用通常基于最优策略,后续决策依赖于早期行动的结果,这些结果通常被研究人员完全观测。因此,实现受限于计算负担和有限模型灵活性。本文建立了一个理论等价性,证明在常见的、温和的独立性和不变性假设下,序列搜索过程最优当且仅当在整个过程中存在所有可行动作的排序,从而引入了最优序列搜索的排序表示。该表示使序列搜索模型的实现成为一种新颖、简单和统一的实证策略。对于经典的Weitzman(1979)模型,所提出的方法减少了模拟需求,同时提高了准确性、计算效率和实现简便性。我们进一步表明,相同策略可扩展到广泛的序列搜索设置,包括部分观测的动作序列和多阶段信息获取,如发现。总体而言,结果增强了序列搜索模型的可操作性和实证适用性。
英文摘要:
Sequential search models provide a powerful framework for studying consumer search using rich data that records the sequence of consumer actions taken during the search process. In existing empirical applications, their implementation often builds on optimal policies, in which later decisions depend on outcomes from earlier actions that are often fully observed by researchers. Therefore, implementation is largely restricted by computation burden and limited model flexibility. This paper establishes a theoretical equivalence showing that, under common and mild assumptions of Independence and Invariance, a sequential search process is optimal if and only if a corresponding ranking over all feasible actions throughout the process holds, thereby introducing a ranking representation of optimal sequential search. This representation enables a novel, simple, and unified empirical strategy for implementing sequential search models. For the classic \cite{weitzman1979optimal} model, the proposed approach reduces simulation requirements while improving accuracy, computational efficiency, and ease of implementation. We further show that the same strategy extends to a broad class of sequential search settings, including partially observed action sequences and multi-stage information acquisition, such as discovery. Overall, the results enhance both the tractability and the empirical applicability of sequential search models.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。