Consensus over evolutionary graphs
Consensus over evolutionary graphs
复制标题
DOI：
10.23919/ecc.2018.8550392
复制
发表时间：
2018-03
期刊：
影响因子：
--
通讯作者：
M. Smyrnakis;N. Freris;H. Tembine
中科院分区：
文献类型：
--
作者：
M. Smyrnakis;N. Freris;H. Tembine
我们在具有动态拓扑的图上建立了平均共识，这些图是由策略主体之间的进化博弈决定的。每个代理具有私人奖励功能，并且动态地决定是否创建新的链接和/或是否以自私和分散的方式删除现有的链接，如由某种随机机制所指示的。该模型产生了一个时变的、依赖于状态的图拓扑，而传统的一致性分析不适用于该拓扑学。对于任何初始条件和图拓扑，我们几乎肯定地证明了渐近平均一致，并且是均方一致的。此外，我们建立了期望中的指数收敛。通过对随机网络的仿真研究，验证了我们的结果。
We establish average consensus on graphs with dynamic topologies prescribed by evolutionary games among strategic agents. Each agent possesses a private reward function and dynamically decides whether to create new links and/or whether to delete existing ones in a selfish and decentralized fashion, as indicated by a certain randomized mechanism. This model incurs a time-varying and state-dependent graph topol- ogy for which traditional consensus analysis is not applicable. We prove asymptotic average consensus almost surely and in mean square for any initial condition and graph topology. In addition, we establish exponential convergence in expectation. Our results are validated via simulation studies on random networks.