The “universal suffrage” selection operator, designed primarily for concept learning inside the system REGAL, is discussed for both overlapping and nonoverlapping populations. Analysis of its behavior is performed by using the “virtual average population” method, a new tool for investigating asymptotic properties of convergence of macroscopic quantities related to the population of a genetic algorithm.