Knowledge Commons of Institute of Automation，CAS
| Optimizing Polynomial-Time Solutions to a Network Weighted Vertex Cover Game | |
Jie Chen; Kaiyi Luo; Changbing Tang; Zhao Zhang; Xiang Li
| |
| Source Publication | IEEE/CAA Journal of Automatica Sinica
 |
| ISSN | 2329-9266 |
| 2023 | |
| Volume | 10Issue:2Pages:512-523 |
| Abstract | Weighted vertex cover (WVC) is one of the most important combinatorial optimization problems. In this paper, we provide a new game optimization to achieve efficiency and time of solutions for the WVC problem of weighted networks. We first model the WVC problem as a general game on weighted networks. Under the framework of a game, we newly define several cover states to describe the WVC problem. Moreover, we reveal the relationship among these cover states of the weighted network and the strict Nash equilibriums (SNEs) of the game. Then, we propose a game-based asynchronous algorithm (GAA), which can theoretically guarantee that all cover states of vertices converging in an SNE with polynomial time. Subsequently, we improve the GAA by adding 2-hop and 3-hop adjustment mechanisms, termed the improved game-based asynchronous algorithm (IGAA), in which we prove that it can obtain a better solution to the WVC problem than using a the GAA. Finally, numerical simulations demonstrate that the proposed IGAA can obtain a better approximate solution in promising computation time compared with the existing representative algorithms. |
| Keyword | |
| DOI | 10.1109/JAS.2022.105521 |
| Citation statistics | |
| Document Type | 期刊论文 |
| Identifier | http://ir.ia.ac.cn/handle/173211/50863 |
| Collection | 学术期刊_IEEE/CAA Journal of Automatica Sinica |
| Recommended Citation GB/T 7714 | Jie Chen,Kaiyi Luo,Changbing Tang,et al. Optimizing Polynomial-Time Solutions to a Network Weighted Vertex Cover Game[J]. IEEE/CAA Journal of Automatica Sinica,2023,10(2):512-523. |
| APA | Jie Chen,Kaiyi Luo,Changbing Tang,Zhao Zhang,&Xiang Li.(2023).Optimizing Polynomial-Time Solutions to a Network Weighted Vertex Cover Game.IEEE/CAA Journal of Automatica Sinica,10(2),512-523. |
| MLA | Jie Chen,et al."Optimizing Polynomial-Time Solutions to a Network Weighted Vertex Cover Game".IEEE/CAA Journal of Automatica Sinica 10.2(2023):512-523. |
| Files in This Item: | Download All | |||||
| File Name/Size | DocType | Version | Access | License | ||
| JAS-2021-0884.pdf（6320KB） | 期刊论文 | 出版稿 | 开放获取 | CC BY-NC-SA | View Download | |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment