Klapes Bryan, Riley Steven, McDowell J J
Department of Psychology, Emory University, Atlanta, GA, USA.
J Exp Anal Behav. 2018 Mar;109(2):336-348. doi: 10.1002/jeab.317. Epub 2018 Mar 6.
A direct-suppression, or subtractive, model of punishment has been supported as the qualitatively and quantitatively superior matching law-based punishment model (Critchfield, Paletz, MacAleese, & Newland, 2003; de Villiers, 1980; Farley, 1980). However, this conclusion was made without testing the model against its predecessors, including the original (Herrnstein, 1961) and generalized (Baum, 1974) matching laws, which have different numbers of parameters. To rectify this issue, we reanalyzed a set of data collected by Critchfield et al. (2003) using information theoretic model selection criteria. We found that the most advanced version of the direct-suppression model (Critchfield et al., 2003) does not convincingly outperform the generalized matching law, an account that does not include punishment rates in its prediction of behavior allocation. We hypothesize that this failure to outperform the generalized matching law is due to significant theoretical shortcomings in model development. To address these shortcomings, we present a list of requirements that all punishment models should satisfy. The requirements include formal statements of flexibility, efficiency, and adherence to theory. We compare all past punishment models to the items on this list through algebraic arguments and model selection criteria. None of the models presented in the literature thus far meets all of the requirements.
一种直接抑制或减法惩罚模型已被认为是在定性和定量方面优于基于匹配律的惩罚模型（克里奇菲尔德、帕莱茨、麦卡利斯和纽兰，2003年；德维利尔斯，1980年；法利，1980年）。然而，得出这一结论时并未将该模型与其前身进行测试，包括原始的（赫尔恩斯坦，1961年）和广义的（鲍姆，1974年）匹配律，它们的参数数量不同。为纠正这一问题，我们使用信息论模型选择标准重新分析了克里奇菲尔德等人（2003年）收集的一组数据。我们发现，直接抑制模型的最先进版本（克里奇菲尔德等人，2003年）并没有令人信服地优于广义匹配律，广义匹配律在行为分配预测中不包括惩罚率。我们假设未能优于广义匹配律是由于模型开发中存在重大理论缺陷。为解决这些缺陷，我们列出了所有惩罚模型应满足的一系列要求。这些要求包括灵活性、效率和对理论的遵循的正式表述。我们通过代数论证和模型选择标准将所有过去的惩罚模型与该列表中的项目进行比较。迄今为止文献中提出的模型均未满足所有要求。
