Acquisition of preference in concurrent chains: Comparing linear-operator and memory-representational models.

Abstract

Two experiments were conducted to test predictions of 2 models for acquisition of preference in concurrent chains. Pigeons were trained with pairs of fixed-interval and variable-interval terminal-link schedules in a successive-reversal design. Results showed that acquisition rate was faster when fixed-interval schedules preceded and when variable-interval schedules followed the reversal and was approximately constant when the same pair of schedules was used. These results were predicted by both linear-operator and memory-representational models. However, only the linear-operator model predicted effects of schedule duration. Overall, these results demonstrated that a simple linear-operator model can account for the major features of preference acquisition in concurrent chains and suggest that choice in transition and steady state may provide convergent validation of a single delay-discounting function.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 16 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.