Computing Equilibria in Anonymous Games
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Paper: The parallel genetic algorithm as function optimizer
Parallel Computing
Hybrid coevolutionary programming for Nash equilibrium search in games with local optima
IEEE Transactions on Evolutionary Computation
Solving the integrated product mix-outsourcing problem using the Imperialist Competitive Algorithm
Expert Systems with Applications: An International Journal
Manufacturer-retailer supply chain coordination: A bi-level programming approach
Advances in Engineering Software
Expert Systems with Applications: An International Journal
Robotics and Computer-Integrated Manufacturing
Investigating the application of opposition concept to colonial competitive algorithm
International Journal of Bio-Inspired Computation
Expert Systems with Applications: An International Journal
A hybrid evolutionary approach to segmentation of non-stationary signals
Digital Signal Processing
Hi-index | 0.00 |
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.