A computerized version of Houston and McNamara's (1981) model of concurrent variable time schedules was used to generate large data sets consisting of behavior inputs and the corresponding reinforcement outputs. The data was analyzed to assess the hypothesis that matching behavior observed with CONCVTVT (or CONCVIVI) schedules is an inevitable product of the operation of the schedule. The results suggest that the generalized matching law does not provide the best description of the results obtained with CONCVTVT schedules; that the parameter value of schedule components determine the framework of the reinforcement efficiency maps of behavior choices; and that by random chance alone matching-like behavior is likely to appear if the reinforcement generation efficiency of the behavior is high.

中文翻译：

---

匹配的外观

休斯顿和麦克纳马拉 (1981) 的并发可变时间表模型的计算机化版本用于生成由行为输入和相应强化输出组成的大型数据集。对数据进行分析以评估这样一种假设，即使用 CONCVTVT（或 CONCVIVI）计划观察到的匹配行为是计划运行的必然产物。结果表明，广义匹配法不能最好地描述使用 CONCVTVT 计划获得的结果；进度组件的参数值决定了行为选择的强化效率图的框架；如果行为的强化生成效率高，则可能会出现类似随机匹配的行为。