arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1202.4134cs.GTcs.DS
收藏

前瞻搜索在博弈中的应用

On the Implications of Lookahead Search in Game Playing

Vahab Mirrokni, Nithum Thain, Adrian Vetta

摘要:

前瞻搜索可能是最自然和最广泛使用的游戏策略。鉴于该方法的实际重要性,本文的目的是提供一个前瞻性搜索在各种应用的理论性能检查。为了使用前瞻搜索来确定策略,每个智能体预测对其移动的多个级别的可能反应(通过使用搜索树),然后选择考虑这些反应来优化其未来收益的策略。智能体可以选择几种优化函数,其中最合适的函数选择将取决于实际游戏的具体情况-我们在示例中说明了这一点。此外,由计算受限代理选择的搜索树的类型可以变化。我们专注于代理只能评估有限数量的情况下,$k$,移动到未来。也就是说,我们使用深度$k$搜索树,并将这种方法称为{ \em k-前瞻搜索}。我们应用我们的方法在五个著名的设置:AdWord拍卖;产业组织(古诺模型);拥塞游戏;有效的效用游戏和基本效用游戏;成本分摊网络设计游戏。我们考虑两个问题。首先,当代理应用前瞻搜索时,期望的结果社会质量是什么?第二,当玩家使用前瞻搜索时,会表现出什么样的交互行为?

英文摘要:

Lookahead search is perhaps the most natural and widely used game playing strategy. Given the practical importance of the method, the aim of this paper is to provide a theoretical performance examination of lookahead search in a wide variety of applications. To determine a strategy play using lookahead search}, each agent predicts multiple levels of possible re-actions to her move (via the use of a search tree), and then chooses the play that optimizes her future payoff accounting for these re-actions. There are several choices of optimization function the agents can choose, where the most appropriate choice of function will depend on the specifics of the actual game - we illustrate this in our examples. Furthermore, the type of search tree chosen by computationally-constrained agent can vary. We focus on the case where agents can evaluate only a bounded number, $k$, of moves into the future. That is, we use depth $k$ search trees and call this approach {\em k-lookahead search}. We apply our method in five well-known settings: AdWord auctions; industrial organization (Cournot's model); congestion games; valid-utility games and basic-utility games; cost-sharing network design games. We consider two questions. First, what is the expected social quality of outcome when agents apply lookahead search? Second, what interactive behaviours can be exhibited when players use lookahead search?

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

↑