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/ACM transactions on networking 2024-12, p.1-16
Hauptverfasser:	Chen, Jie, Ding, Yong, Zhou, Rongpei, Qiu, Zhifeng, Gui, Weihua
Format:	Artikel
Sprache:	eng
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
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!