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

Full description

Bibliographic Details

Published in:	IEEE Transactions on Networking Vol. 33; no. 2; pp. 913 - 928
Main Authors:	Chen, Jie, Ding, Yong, Zhou, Rongpei, Qiu, Zhifeng, Gui, Weihua
Format:	Journal Article
Language:	English
Published:	IEEE 01.04.2025
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!