A Game Theoretic Approach for a Minimal Secure Dominating Set
文献类型：期刊论文
| 作者 | Xiuyang Chen; Changbing Tang; Zhao Zhang |
| 刊名 | IEEE/CAA Journal of Automatica Sinica
 |
| 出版日期 | 2023 |
| 卷号 | 10期号:12页码:2258-2268 |
| 关键词 | Algorithmic game theory multi-agent systems potential game secure dominating set |
| ISSN号 | 2329-9266 |
| DOI | 10.1109/JAS.2023.123315 |
| 英文摘要 | The secure dominating set (SDS), a variant of the dominating set, is an important combinatorial structure used in wireless networks. In this paper, we apply algorithmic game theory to study the minimum secure dominating set (MinSDS) problem in a multi-agent system. We design a game framework for SDS and show that every Nash equilibrium (NE) is a minimal SDS, which is also a Pareto-optimal solution. We prove that the proposed game is an exact potential game, and thus NE exists, and design a polynomial-time distributed local algorithm which converges to an NE in O |
| 源URL | [http://ir.ia.ac.cn/handle/173211/52469]  |
| 专题 | 自动化研究所_学术期刊_IEEE/CAA Journal of Automatica Sinica |
| 推荐引用方式 GB/T 7714 | Xiuyang Chen,Changbing Tang,Zhao Zhang. A Game Theoretic Approach for a Minimal Secure Dominating Set[J]. IEEE/CAA Journal of Automatica Sinica,2023,10(12):2258-2268. |
| APA | Xiuyang Chen,Changbing Tang,&Zhao Zhang.(2023).A Game Theoretic Approach for a Minimal Secure Dominating Set.IEEE/CAA Journal of Automatica Sinica,10(12),2258-2268. |
| MLA | Xiuyang Chen,et al."A Game Theoretic Approach for a Minimal Secure Dominating Set".IEEE/CAA Journal of Automatica Sinica 10.12(2023):2258-2268. |
入库方式： OAI收割
来源：自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。