A game theoretic solver for the minimum weighted vertex cover

  • Changhao Sun
  • , Xiaochu Wang*
  • , Huaxin Qiu
  • , Qian Chen
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Toward the global optimality and computation time reduction, we address the minimum weighted vertex cover (MWVC) problem by proposing a population based game theoretic optimizer (PGTO) that combines learning in games with population based optimization. A population of candidate solutions are iterated through the procedures of swarm evolution (SE), learning in games (LIG), and local search (LS). Via strict theoretic analysis, we prove that LIG converges with probability one to Nash equilibria which could be further refined by LS. Numerical simulations show that a larger population size and a proper mutation probability are more likely to provide the best performance. Comparison experiments with typical algorithms demonstrate the superiority of the presented methodology to the state of the art, both in terms of solution efficiency and computation time.

Original languageEnglish
Title of host publication2019 IEEE International Conference on Systems, Man and Cybernetics, SMC 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1920-1925
Number of pages6
ISBN (Electronic)9781728145693
DOIs
StatePublished - Oct 2019
Externally publishedYes
Event2019 IEEE International Conference on Systems, Man and Cybernetics, SMC 2019 - Bari, Italy
Duration: 6 Oct 20199 Oct 2019

Publication series

NameConference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
Volume2019-October
ISSN (Print)1062-922X

Conference

Conference2019 IEEE International Conference on Systems, Man and Cybernetics, SMC 2019
Country/TerritoryItaly
CityBari
Period6/10/199/10/19

Fingerprint

Dive into the research topics of 'A game theoretic solver for the minimum weighted vertex cover'. Together they form a unique fingerprint.

Cite this