The choice of how to represent the search space for a genetic algorithm (GA) is critical to the GA's performance. Representations are usually engineered by hand and fixed for the duration of the GA run. Here a new method is described in which the degrees of freedom of the representation---i.e....

The notion of ``evolvability''---the ability of a population to produce variants fitter than any yet existing---is developed as it applies to genetic algortithms. A theoretical analysis of the dynamics of genetic programming predicts the existence of a novel, emergent selection phenomenon: the...

In an electoral framework of unidimensional two-candidate spatial competition with probabilistic voting, special interest groups present candidates with schedules that give the level of campaign contribution they will make for each feasible candidate policy location. Candidates, motivated by the...

A large body of literature documents that returns from currency speculation are highly volatile and possess a predictable component, which is itself highly volatile and serially correlated. Explaining the returns from currency speculation through the presence of a risk premium has proven...