Mace, F. C., Neef, N. A., Shade, D., & Mauro, B. C. (1996).
Effects of problem difficulty and reinforcer quality on time allocated to concurrent arithmetic problems.
Journal of Applied Behavior Analysis,
29, 11-24.
Students with learning difficulties participated in two studies
that analyzed the effects of problem difficulty and reinforcer
quality upon time allocated to two sets of arithmetic problems
reinforced according to a concurrent variable-interval 30-s
variable-interval 120-s schedule. In Study 1, high- and
low-difficulty arithmetic problems were systematically combined
with rich and lean concurrent schedules (nickels used as
reinforcers) across conditions using a single-subject design. The
pairing of the high-difficulty problems with the richer schedule
failed to offset time allocated to that alternative. Study 2
investigated the interactive effects of problem difficulty and
reinforcer quality (nickels vs. program money) upon time
allocation to arithmetic problems maintained by the concurrent
schedules of reinforcement. Unlike problem difficulty, the
pairing of the lesser quality reinforcer (program money) with the
richer schedule reduced the time allocated to that alternative.
The magnitude of this effect was greatest when combined with the
low-difficulty problems. These studies have important
implications for a matching law analysis of asymmetrical
reinforcement variables that influence time allocation.
DESCRIPTORS: problem difficulty, reinforcer quality, matching law,
concurrent schedules