Colonial Competitive Algorithm as a Tool for Nash Equilibrium Point Achievement

  • Authors:
  • Ramin Rajabioun;Esmaeil Atashpaz-Gargari;Caro Lucas

  • Affiliations:
  • Control and Intelligent Processing Centre of Excellence (CIPCE), School of Electrical and Computer Engineering, University of Tehran, Tehran, Iran;Control and Intelligent Processing Centre of Excellence (CIPCE), School of Electrical and Computer Engineering, University of Tehran, Tehran, Iran;Control and Intelligent Processing Centre of Excellence (CIPCE), School of Electrical and Computer Engineering, University of Tehran, Tehran, Iran

  • Venue:
  • ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents an application of Colonial Competitive Algorithm (CCA) in game theory and multi-objective optimization problems. The recently introduced CCA has proven its excellent capabilities, such as faster convergence and better global optimum achievement. In this paper CCA is used to find Nash Equilibrium points of nonlinear non-cooperative games. The proposed method can also be used as an alternative approach to solve multi-objective optimization problems. The effectiveness of the proposed method, in comparison to Genetic Algorithm, is proven through several static and dynamic example games and also multi-objective problems.