The assumptions underlying the generalized matching law

Allen (1981) derived the power-function generalization of the matching law from a functional equation involving relative response rates on three concurrently available schedules of reinforcement. This paper defines the conditions (relative homogeneity and independence) under which a more general class of behavioral laws reduces to the power law. The proof also removes two deficiencies of Allen's result (discussed by Houston, 1982), which are, first, that his derivation produces a power law without a bias coefficient, and second, that it holds only for experiments with three or more concurrent schedules.