Colonial Competitive Algorithm as a Tool for Nash Equilibrium Point Achievement

DOI10.1007/978-3-540-69848-7_55zbMath1297.90187OpenAlexW1898604570MaRDI QIDQ3512532

Esmaeil Atashpaz-Gargari, Caro Lucas, Ramin Rajabioun

Publication date: 18 July 2008

Published in: Computational Science and Its Applications – ICCSA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69848-7_55

zbMATH Keywords

game theoryevolutionary algorithmsglobal Nash equilibriumcolonial competitive algorithm (CCA)

Mathematics Subject Classification ID

Noncooperative games (91A10) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (7)

Game theoretic analysis of pricing and vertical cooperative advertising of a retailer-duopoly with a common manufacturer ⋮ Structural damage localization and evaluation based on modal data via a new evolutionary algorithm ⋮ Ethnic groups chaos game optimization algorithm for optimal design of steel structures considering seismic risk ⋮ OPTIMUM DESIGN PROCESS OF VIBRATION ABSORBER VIA IMPERIALIST COMPETITIVE ALGORITHM ⋮ Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm ⋮ New Imperialist Competitive Algorithm to solve the travelling salesman problem ⋮ A soft computing-based approach to optimise queuing-inventory control problem

Cites Work

• Unnamed Item
• Unnamed Item
• The parallel genetic algorithm as function optimizer
• On the evolution of optimizing behavior
• Non-cooperative games
• Equilibrium points in n -person games

This page was built for publication: Colonial Competitive Algorithm as a Tool for Nash Equilibrium Point Achievement