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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE Transactions on Networking Jg. 33; H. 2; S. 913 - 928
Hauptverfasser:	Chen, Jie, Ding, Yong, Zhou, Rongpei, Qiu, Zhifeng, Gui, Weihua
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	IEEE 01.04.2025
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!