Choice between repleting/depleting patches: A concurrent-schedule procedure

Six pigeons responded on two concurrently available keys that defined patches with the following characteristics. Reinforcer stores repleted on a patch as a linear function of time when the bird had last responded to the other patch, or else did not replete. Repletion schedules thus timed only when the bird was absent from the patch. Reinforcer stores on a patch could be depleted and reinforcers obtained, again as a linear function of time, when the bird responded on a key. Depletion schedules thus timed only when the birds were present at a patch. Experiment 1 investigated changing relative depletion rates when repletion rates were constant and equal (Part 1) and changing relative repletion rates when the depletion rates were constant and equal (Part 2). Response- and time-allocation ratios conformed to a generalized matching relation with obtained reinforcer ratios, and there appeared to be no control by the size of the reinforcer stores. In Experiment 2, absolute depletion rates were varied with a pair of unequal repletion rates (Part 3), and absolute repletion rates were varied with a pair of unequal depletion rates (Part 4). Dwell times in the patches were not affected by either variation. Melioration theory predicted the results of Experiment 1 quite closely but erroneously predicted changing dwell times in Experiment 2. Molar maximization theory did not accurately predict the results of either experiment.