arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1106.1236cs.GTcs.CCcs.NI
收藏

动态网络上的连通性博弈

Connectivity Games over Dynamic Networks

Sten Grüner, Frank G. Radmacher, Wolfgang Thomas

摘要:

分析了一个研究动态网络的博弈论模型。该模型的动机是受故障的节点和恢复需要资源的通信网络。相应的双人游戏是在"解构者"(可以删除节点)和"构造者"(可以在特定条件下恢复甚至创建节点)之间进行的。我们还通过允许构造器改变相邻节点的标签来包含信息流的功能。作为构造器的目标,要连接的网络属性被认为是安全条件或可达性条件(在后一种情况下,从非连接网络开始)。我们证明了在何种条件下,相应的游戏构造是可判定的,并在这种情况下,获得上,下复杂性的界限,以及算法来自获胜的策略。由于参与者之间的不对称性,安全性和可达性目标不是双重的,而是分开对待的。

英文摘要:

A game-theoretic model for the study of dynamic networks is analyzed. The model is motivated by communication networks that are subject to failure of nodes and where the restoration needs resources. The corresponding two-player game is played between "Destructor" (who can delete nodes) and "Constructor" (who can restore or even create nodes under certain conditions). We also include the feature of information flow by allowing Constructor to change labels of adjacent nodes. As objective for Constructor the network property to be connected is considered, either as a safety condition or as a reachability condition (in the latter case starting from a non-connected network). We show under which conditions the solvability of the corresponding games for Constructor is decidable, and in this case obtain upper and lower complexity bounds, as well as algorithms derived from winning strategies. Due to the asymmetry between the players, safety and reachability objectives are not dual to each other and are treated separately.

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

↑