自动化学报：英文版2023，Vol.10Issue(2)：P.512-523,12.DOI:10.1109/JAS.2022.105521
Optimizing Polynomial-Time Solutions to a Network Weighted Vertex Cover Game
摘要
关键词
Game-based asynchronous algorithm(GAA)/game optimization/polynomial time/strict Nash equilibrium(SNE)/weighted vertex cover(WVC)分类
信息技术与安全科学引用本文复制引用
Jie Chen,Kaiyi Luo,Changbing Tang,Zhao Zhang,Xiang Li..Optimizing Polynomial-Time Solutions to a Network Weighted Vertex Cover Game[J].自动化学报：英文版,2023,10(2):P.512-523,12.基金项目
partly supported by the National Natural Science Foundation of China(61751303,U20A2068,11771013) （61751303,U20A2068,11771013）
the Zhejiang Provincial Natural Science Foundation of China(LD19A010001) （LD19A010001）
the Fundamental Research Funds for the Central Universities。 （）
