An Evolutionary Game Optimization to Vertex Cover of Dynamic Networks

摘要：

　　Vertex cover is one of the best known combinatorial optimization problems.Treating each vertex as an intelligent rational agent,we model vertex cover problem under the framework of evolutionary game theory,where players have different rates of forming and breaking links,and such linking dynamics introduces a transformation of the payoff matrix.We propose an algorithm to solve the vertex cover problem of dynamic networks,and find that a better approximate solution to the minimum vertex cover of dynamic networks can be obtained by choosing proper parameters.

关键词： Vertex cover dynamic networks evolutionary game theory Nash equilibrium

作者: LI Ang TANG Chang Bing LI Xiang

作者单位: Adaptive Networks and Control Lab,Electronic Engineering Department,Fudan University,Shanghai 200433,P. R. China

会议类型: 国际会议

会议名称: The 33th Chinese Control Conference第33届中国控制会议

会议地点: 南京

会议语种:英文

页码: 2757-2762

在线出版日期: 2014-07-28（万方平台首次上网日期，不代表论文的发表时间）