| Abstract: | An operant simulation of foraging through baited and empty patches was studied with 4 pigeons. On a three-key panel, side keys were designated as patches, and successive opportunities to complete 16 fixed-ratio 10 schedules on side keys were defined as encounters with feeders. In a random half of the patches in any session, some of the fixed-ratio 10 schedules yielded reinforcement (baited feeders) and the other schedules yielded nonreinforcement (empty feeders). In the other half of the patches, all feeders were empty. Pigeons could travel between patches at any time by completing a fixed-ratio schedule on the center key. An optimal foraging model was tested in Experiments 1 and 2 by varying center-key travel time and number of baited feeders in baited patches. The ordinal predictions that number of feeders visited in empty patches would increase with travel time and decrease as number of baited feeders increased were supported, but pigeons visited far more feeders in empty patches than the optimal number predicted by the model to maximize energy/time. In Experiment 3, evidence was found to suggest that the number of empty feeders encountered before the first baited feeder in baited patches is an important factor controlling leaving empty patches. |
