arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2012.11900econ.TH
收藏

利用多臂强盗和秘书扩大重复消费者搜索

Expanding on Repeated Consumer Search Using Multi-Armed Bandits and Secretaries

Tung Yu Marco Chan

摘要:

我们试图采取不同的方法来推导Fishman和Rob(1995)中重复消费者搜索模型的最优搜索策略,其主要动机是放弃每个时期价格分布$F(p)$的先验知识假设。我们将通过引入著名的多臂强盗问题(MAB)来做到这一点。我们首先修改的MAB框架,以适应设置的重复消费者搜索模型和制定的目标作为一个动态优化问题。然后,给定任何探索序列,我们使用贝尔曼方程为该序列中的每个商店分配一个值。然后,我们继续分解成个人的最佳停止问题的每个时期,碰巧与著名的秘书问题的框架,我们继续推导出最佳停止政策。我们将看到,在每个周期中实施最优停止策略通过“向前归纳”推理解决了原始动态优化。

英文摘要:

We seek to take a different approach in deriving the optimal search policy for the repeated consumer search model found in Fishman and Rob (1995) with the main motivation of dropping the assumption of prior knowledge of the price distribution $F(p)$ in each period. We will do this by incorporating the famous multi-armed bandit problem (MAB). We start by modifying the MAB framework to fit the setting of the repeated consumer search model and formulate the objective as a dynamic optimization problem. Then, given any sequence of exploration, we assign a value to each store in that sequence using Bellman equations. We then proceed to break down the problem into individual optimal stopping problems for each period which incidentally coincides with the framework of the famous secretary problem where we proceed to derive the optimal stopping policy. We will see that implementing the optimal stopping policy in each period solves the original dynamic optimization by `forward induction' reasoning.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑