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

Full description

Bibliographic Details

Published in:	IEEE transactions on automation science and engineering Vol. 22; pp. 20649 - 20666
Main Authors:	Chen, Jie, Wu, Jie, Zhou, Rongpei, Gui, Weihua
Format:	Journal Article
Language:	English
Published:	IEEE 2025
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!