A coevolutionary minimax algorithm for the detection of nash equilibrium

Authors:
Andrew Koh
Affiliations:
Institute for Transport Studies, University of Leeds, Leeds, United Kingdom
Venue:
SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation
Year:
2012

Citing 6
Cited 0

Power System Analysis and Design

Power System Analysis and Design
A new look at solving minimax problems with coevolutionary genetic algorithms

Metaheuristics
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)

Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Practical Optimization: Algorithms and Engineering Applications

Practical Optimization: Algorithms and Engineering Applications
An evolutionary algorithm based on Nash Dominance for Equilibrium Problems with Equilibrium Constraints

Applied Soft Computing
Hybrid coevolutionary programming for Nash equilibrium search in games with local optima

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces CoMiniMax, a coevolutionary Minimax algorithm, based on Differential Evolution, for the detection of Nash Equilibrium in games. We discuss the robust theoretical principles of the proposed algorithm. The algorithm is illustrated on examples in economics, transportation and deregulated electricity markets. Numerical experience demonstrates that the algorithm is a useful tool for the study of Nash Equilibrium problems.