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

团队最大最小均衡:效率界与算法

Team-maxmin equilibrium: efficiency bounds and algorithms

University of Milan(米兰大学);Politecnico di Milano(米兰理工大学)

Nicola Basilico, Andrea Celli, Giuseppe De Nittis, Nicola Gatti

摘要:

团队最大最小均衡规定了一个团队的最佳策略,理性的球员共享相同的目标,而没有能力在战略游戏中与对手的策略相关联。此解决方案概念可以捕获代理控制多个无法通信的资源(对应于团队成员)的情况。众所周知,这样的平衡总是存在的,它是唯一的(除非退化),这些属性使其成为一个可信的解决方案的概念,在现实世界中的应用,特别是在安全的情况下。然而,据我们所知,团队最大最小均衡在文献中几乎完全未被探索。在本文中,我们研究了Team-maxmin平衡点的有效性的界。纳什均衡和w.r.t.最大最小均衡时,团队成员可以采取相关的策略。此外,我们研究了一些算法,找到和/或近似的平衡,讨论他们的理论保证和评估他们的性能,通过使用一个标准的测试平台的游戏实例。

英文摘要:

The Team-maxmin equilibrium prescribes the optimal strategies for a team of rational players sharing the same goal and without the capability of correlating their strategies in strategic games against an adversary. This solution concept can capture situations in which an agent controls multiple resources-corresponding to the team members-that cannot communicate. It is known that such equilibrium always exists and it is unique (unless degeneracy) and these properties make it a credible solution concept to be used in real-world applications, especially in security scenarios. Nevertheless, to the best of our knowledge, the Team-maxmin equilibrium is almost completely unexplored in the literature. In this paper, we investigate bounds of (in)efficiency of the Team-maxmin equilibrium w.r.t. the Nash equilibria and w.r.t. the Maxmin equilibrium when the team members can play correlated strategies. Furthermore, we study a number of algorithms to find and/or approximate an equilibrium, discussing their theoretical guarantees and evaluating their performance by using a standard testbed of game instances.

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

↑