solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看8339次
Consensus over evolutionary graphs. (arXiv:1803.02564v1 [math.OC])
来源于:arXiv
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 topology 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. 查看全文>>