A Minimal Memory Game-Based Distributed Algorithm to Vertex Cover of Networks
Published: May 1, 2021
Abstract
The vertex cover of networks is a classical combinatorial optimization problem. In this paper, we investigate the vertex cover problem solved by the memory-based best response update rule, which can not converge to a strict Nash equilibrium (SNE) with memory length m =3D 1. To overcome this shortcoming, a bounded rational behavioral (BRB) update rule is newly proposed in this paper. We prove that the BRB with m =3D 1 can guarantee that the whole...
Paper Details
Title
A Minimal Memory Game-Based Distributed Algorithm to Vertex Cover of Networks
Published Date
May 1, 2021
Citation AnalysisPro
You’ll need to upgrade your plan to Pro
Looking to understand the true influence of a researcher’s work across journals & affiliations?
- Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
- Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.
Notes
History