控制理论与应用2026，Vol.43Issue(2)：239-248,10.DOI:10.7641/CTA.2024.30734
网络分布式k路点覆盖的空间博弈方法
Spatial game approach for the distributed k-path vertex cover of networks
摘要
Abstract
As a significant branch of covering problems on networks,many difficulties encountered in real-world complex systems can be viewed as instances of the k-path vertex cover problem.In distributed systems,one of the crucial research issues to achieve network covering optimization is how to design decentralized strategies for autonomous decision-making by agents.In this paper,the k-path vertex cover problem is modeled as a spatial game on networks,where individual vertices act as rational agents and communicate exclusively with their neighbors.This study analyzes the relationship between strong Nash equilibrium(SONE)and the k-path vertex cover state within the context of non-cooperative games.Additionally,the proposed game-based synchronous aspiration-driven algorithm(GSAA)is shown to converge to SONEs of the four-player coalitions within finite time.The effectiveness of the algorithm is validated through numerical simulations.In the context of the k-path vertex cover problem,the link between solutions and game equilibria is examined from a coalition-based perspective.This paper introduces a novel approach for solving distributed optimization problems with local coupling constraints on networks within the framework of game theory.关键词
复杂网络/k路点覆盖/空间博弈/分布式优化/强纳什均衡Key words
complex networks/k-path vertex cover/spatial game/distributed optimization/strong Nash equilibrium引用本文复制引用
齐龙,李翔..网络分布式k路点覆盖的空间博弈方法[J].控制理论与应用,2026,43(2):239-248,10.基金项目
国家自然科学基金区域创新发展联合基金项目(U23A20331)资助.Supported by the Joint Fund for Regional Innovation and Development of the National Natural Science Foundation of China(U23A20331). （U23A20331）
