Colonial Competitive Algorithm as a Tool for Nash Equilibrium Point Achievement
From MaRDI portal
Recommendations
- Differential evolution particle swarm optimization algorithm based on good point set for computing Nash equilibrium of finite noncooperative game
- scientific article; zbMATH DE number 2034487
- Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players
- Two-stage multimodal optimization algorithm for solving Nash equilibrium
- Applications of genetic differentiation algorithm in solving many person noncooperative game's Nash equilibrium
Cites work
- scientific article; zbMATH DE number 5145289 (Why is no real title available?)
- scientific article; zbMATH DE number 706270 (Why is no real title available?)
- Equilibrium points in n -person games
- Non-cooperative games
- On the evolution of optimizing behavior
- The parallel genetic algorithm as function optimizer
Cited in
(8)- Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm
- Structural damage localization and evaluation based on modal data via a new evolutionary algorithm
- New imperialist competitive algorithm to solve the travelling salesman problem
- Ethnic groups chaos game optimization algorithm for optimal design of steel structures considering seismic risk
- A soft computing-based approach to optimise queuing-inventory control problem
- Optimum design process of vibration absorber via imperialist competitive algorithm
- Game theoretic analysis of pricing and vertical cooperative advertising of a retailer-duopoly with a common manufacturer
- Colonial competitive algorithm
This page was built for publication: Colonial Competitive Algorithm as a Tool for Nash Equilibrium Point Achievement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512532)