arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1203.2301cs.GTmath.GR
收藏

可数对策均衡的存在性:一种代数方法

Existence of equilibria in countable games: an algebraic approach

Valerio Capraro, Marco Scarsini

摘要:

虽然有限博弈的混合扩展总是允许均衡,但可数博弈的情况并非如此,最著名的例子是Wald的pick-the-larger-integer博弈。一些作者已经提供了无限对策中平衡点存在的条件。这些条件是典型的拓扑性质,很少适用于可数对策。当策略集为可数群且支付为群运算的函数时,我们建立了可数对策均衡的存在性结果。为了得到平衡点的存在性,必须允许可加混合策略。这就产生了一个问题,选择一个产品措施的混合战略。我们提出了一个家庭这样的选择,并证明存在一个平衡,不依赖于选择。作为一个副产品,我们表明,如果不允许添加剂的混合策略,那么沃尔德的游戏承认一个均衡。我们还证明了存在平衡的非平凡扩展的匹配便士和石头剪刀布。最后,我们将主要结果推广到不可数对策。

英文摘要:

Although mixed extensions of finite games always admit equilibria, this is not the case for countable games, the best-known example being Wald's pick-the-larger-integer game. Several authors have provided conditions for the existence of equilibria in infinite games. These conditions are typically of topological nature and are rarely applicable to countable games. Here we establish an existence result for the equilibrium of countable games when the strategy sets are a countable group and the payoffs are functions of the group operation. In order to obtain the existence of equilibria, finitely additive mixed strategies have to be allowed. This creates a problem of selection of a product measure of mixed strategies. We propose a family of such selections and prove existence of an equilibrium that does not depend on the selection. As a byproduct we show that if finitely additive mixed strategies are allowed, then Wald's game admits an equilibrium. We also prove existence of equilibria for nontrivial extensions of matching-pennies and rock-scissors-paper. Finally we extend the main results to uncountable games.

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

↑