A Game Theoretic Approach for a Minimal Secure Dominating Set

doi:10.1109/JAS.2023.123315

CORC > 自动化研究所 > 中国科学院自动化研究所 > 学术期刊 > IEEE/CAA Journal of Automatica Sinica

	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 (n) rounds of interactions. Extensive experiments are done to test the performance of our algorithm, and some interesting phenomena are witnessed.
内容类型	期刊论文
源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.