ABA Fundamentals

Residence time and choice in concurrent foraging schedules.

Jones et al. (1996) · Journal of the experimental analysis of behavior 1996
★ The Verdict

Pigeons hang longer in the patch that pays faster, yet still fall short of the best payoff — plan for this slight undermatching in human concurrent schedules.

✓ Read this if BCBAs who run concurrent schedules or teach choice-making.
✗ Skip if Clinicians working only with single-schedule DTT.

01Research in Context

01

What this study did

Ghaziuddin et al. (1996) watched pigeons choose between two feeding spots.

Each spot gave grain at a different speed.

The birds could hop between spots whenever they wanted.

02

What they found

Birds stayed longer where grain came faster.

They still did not move enough to get the most food possible.

This gap is called undermatching.

03

How this fits with other research

PLISKOFF (1963) first showed perfect matching: pecks lined up exactly with payoff rate.

Hopkins et al. (1977) later re-checked old data and found the same undermatching M saw.

Friedling et al. (1979) showed undermatching fades after six sessions, hinting history matters.

Together the papers say: animals rarely maximize; they get close and then stop.

04

Why it matters

When you set up two tasks for a client, expect them to split time a bit shy of the richer one.

Do not chase perfect 100% allocation; watch for steady, slightly flat preference instead.

Use at least a week per condition so old history can wash out.

Free CEUs

Want CEUs on This Topic?

The ABA Clubhouse has 60+ free CEUs — live every Wednesday. Ethics, supervision & clinical topics.

Join Free →
→ Action — try this Monday

Give two tasks with 3:1 reinforcer rates, then look for about a 2.5:1 time split — tweak only if it drifts wider.

02At a glance

Intervention
not applicable
Design
single case other
Sample size
5
Population
not specified
Finding
not reported

03Original abstract

Five pigeons were trained on a concurrent-schedule analogue of the "some patches are empty" procedure. Two concurrently available alternatives were arranged on a single response key and were signaled by red and green keylights. A subject could travel between these alternatives by responding on a second yellow "switching" key. Following a changeover to a patch, there was a probability (p) that a single reinforcer would be available on that alternative for a response after a time determined by the value of lambda, a probability of reinforcement per second. The overall scheduling of reinforcers on the two alternatives was arranged nonindependently, and the available alternative was switched after each reinforcer. In Part 1 of the experiment, the probabilities of reinforcement, rho(red) and rho(green), were equal on the two alternatives, and the arranged arrival rates of reinforcers, lambda(red) and lambda(green), were varied across conditions. In Part 2, the reinforcer arrival times were arranged to be equal, and the reinforcer probabilities were varied across conditions. In Part 3, both parameters were varied. The results replicated those seen in studies that have investigated time allocation in a single patch: Both response and time allocation to an alternative increased with decreasing values of lambda and with increasing values of rho, and residence times were consistently greater than those that would maximize obtained reinforcer rates. Furthermore, both response- and time-allocation ratios undermatched mean reinforcer-arrival time and reinforcer-frequency ratios.

Journal of the experimental analysis of behavior, 1996 · doi:10.1901/jeab.1996.65-423