Relative allocation on concurrent schedules can depend on schedule parameters when behavioral parameters are constant.
Low switching can fake a strong preference—check switch counts before you trust allocation numbers.
01Research in Context
What this study did
The authors built a math model of two schedules running side by side.
They asked: can the way we split our time look different even when the real behavior stays the same?
The answer was yes—if the organism rarely switches, the numbers can fool you.
What they found
Low switch rates can make the richer schedule look even richer than it is.
So a 70-30 split on paper may not mean the learner truly prefers that side.
The schedule itself, not the child, can tilt the scoreboard.
How this fits with other research
Glenn (1988) later showed rats almost never switch when only the active counter grows.
That real-data picture lines up with the model’s warning: stay quiet, get lopsided scores.
Bromley et al. (1998) worked with adults with intellectual disability and preschool kids on fixed-ratio schedules.
They saw people move to the harder task when the pay was better—clear choice.
Their clean data work because their learners switched often; the 1987 paper says if switching drops, the same method could mislead.
Davison et al. (1995) found pigeons act more indifferent than the matching law predicts when ratios hit 27:1.
Both papers shout the same message: raw allocation numbers need a second look.
Why it matters
Before you call a 80-20 split a strong preference, count how many times the client switched sides.
If switches are rare, run a few probe sessions with easier change-over delays or richer switch prompts.
Only then trust the proportion as a true voice of preference.
Want CEUs on This Topic?
The ABA Clubhouse has 60+ free CEUs — live every Wednesday. Ethics, supervision & clinical topics.
Join Free →Add a simple switch tally to your next concurrent reinforcer assessment; if switches fall below five per session, shorten the change-over delay and retest.
02At a glance
03Original abstract
We develop a simple model of switching between the initial links of a concurrent-chain procedure. Behavior is determined by four parameters mu(1), mu(2), q(1), and q(2). The first two are the basic rates of switching from Schedule 1 and Schedule 2, respectively. The second two are the probabilities of leaving Schedule 1 and Schedule 2 after the corresponding terminal link has been completed. We show that for fixed values of these four parameters, the relative allocation on the initial links may change as a result of changes in initial-link schedules. The effect can be quite large if the switching rates are low. An implication is that relative allocation is not necessarily a good measure of behavior.
Journal of the experimental analysis of behavior, 1987 · doi:10.1901/jeab.1987.47-127