Holder functions and deception of genetic algorithms

We present a deception analysis for Holder functions. Our approach uses a decomposition on the Haar basis, which reflects in a natural way the Holder structure of the function. This allows the relation of the deception, the Holder exponent, and some parameters of the genetic algorithms (GAs). These results prove that deception is connected to the irregularity of the fitness function and shed a new light on the schema theory. In addition, this analysis may assist in understanding the influence of some of the parameters on the performance of a GA