A Distributed Symmetric Game Optimization to 3-Path Vertex Cover of Networks

As a typical combinatorial optimization problem, the 3-path vertex cover problem has wide applications in practice. To solve the 3-path vertex cover problem from the perspective of distributed optimization, we treat each vertex as an agent (i.e., player) with computation, and decision-making capabil...

Celý popis

Podrobná bibliografie

Vydáno v:	IEEE Transactions on Networking Ročník 33; číslo 2; s. 913 - 928
Hlavní autoři:	Chen, Jie, Ding, Yong, Zhou, Rongpei, Qiu, Zhifeng, Gui, Weihua
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	IEEE 01.04.2025
Témata:	3-path vertex cover algorithm complexity Approximation algorithms distributed optimization Games Monitoring Nash equilibrium NP-hard problem Optimization strict Nash equilibrium symmetric game Symmetric matrices Training Wireless sensor networks
ISSN:	2998-4157, 2998-4157
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!