MATCHING, DELAY‐REDUCTION, AND MAXIMIZING MODELS FOR CHOICE IN CONCURRENT‐CHAINS SCHEDULES

Models of choice in concurrent‐chains schedules are derived from melioration, generalized matching, and optimization. The resulting models are compared with those based on Fantino's (1969, 1981) delay‐reduction hypothesis. It is found that all models involve the delay reduction factors (T — t2L) and (T — t2R), where T is the expected time to primary reinforcement and t2L, t2R are the durations of the terminal links. In particular, in the case of equal initial links, the model derived from melioration coincides with Fantino's original model for full (reliable) reinforcement and with the model proposed by Spetch and Dunn (1987) for percentage (unreliable) reinforcement. In the general case of unequal initial links, the model derived from melioration differs from the revised model advanced by Squires and Fantino (1971) only in the factors affecting the delay‐reduction terms (T — t2L) and (T — t2R). The models of choice obtained by minimizing the expected time to reinforcement depend on the type of feedback functions used. In particular, if power feedback functions are used, the optimization model coincides with that obtained from melioration.