Distributed Potential Game Optimization to 3-Path Vertex Cover of Networks

3-path vertex cover of networks is a typical optimization problem in network science, which has a wide range of applications. Toward a 3-path vertex cover of networks from distributed optimization, we first established a potential game to describe the 3-path vertex cover problem. Next, we analyze th...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on automation science and engineering Ročník 22; s. 20649 - 20666
Hlavní autori:	Chen, Jie, Wu, Jie, Zhou, Rongpei, Gui, Weihua
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE 2025
Predmet:	3-path vertex cover Analytical models Approximation algorithms Artificial intelligence Automation bounded best response Complexity theory Cost function Distributed algorithms distributed potential game Games memory length Nash equilibrium Numerical models strict Nash equilibrium
ISSN:	1545-5955, 1558-3783
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!