Newwork Games with and without Synchroneity
Newwork Games with and without Synchroneity
复制标题
具有或不具有同步性的 Newwork 游戏
DOI：
10.1007/978-3-642-25280-8_9
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
Ahmad Termimi Ab Ghani and Kazuyuki Tanaka
中科院分区：
文献类型：
--
作者：
Ahmad Termimi Ab Ghani and Kazuyuki Tanaka
为了解决网络安全问题，Mavronicholas等人[6]在一个无向图上引入了一个策略博弈，该图的节点暴露在攻击者的感染之下，其边缘受到防御者的保护。随后，MedSalem等人[9]推广了该模型，使其具有许多防御者而不是单个防御者。在文献[1]中，我们引入了一个新的角色互换的网络博弈，并给出了其纯纳什均衡的图论刻画。在本文中，我们研究混合纳什均衡随机策略在这个新的游戏，然后我们推广我们的网络游戏的异步游戏，其中两个球员反复执行同时的游戏。虽然异步游戏形式上是一个无限的游戏，我们表明，它有一个稳定的解决方案，减少到一个有限的游戏。
To formulate a network security problem, Mavronicholas et al. [6] introduced a strategic game on an undirected graph whose nodes are exposed to infection by attackers, and whose edges are protected by a defender. Subsequently, MedSalem et al. [9] generalized the model so that they have many defenders instead of a single defender. Then in [1], we introduced a new network game with the roles of players interchanged, and obtained a graph-theoretic characterization of its pure Nash equilibria. In this paper we study mixed Nash equilibria for stochastic strategies in this new game, and then we generalize our network game to an asynchronous game, where two players repeatedly execute simultaneous games. Although the asynchronous game is formally an infinite game, we show that it has a stable solution by reducing it to a finite game.