Runtime analysis of competitive co-evolutionary algorithms for maximin optimisation of a bilinear function
Per Kristian Lehre · Proceedings of the Genetic and Evolutionary Computation Conference · 2022
Co-evolutionary algorithms have a wide range of applications, such as in hardware design, evolution of strategies for board games, and patching software bugs. However, these algorithms are poorly understood and applications are often limited by pathological behaviour, such as loss of gradient, relative over-generalisation, and mediocre objective stasis. It is an open challenge to develop a theory that can predict when co-evolutionary algorithms find solutions efficiently and reliably.