Pub Date : 2026-01-27DOI: 10.1016/j.jmp.2026.102970
Karim Kilani , Hans Colonius
Falmagne’s representation problem is revisited by maximizing Shannon entropy applied to ranking probabilities, under the linear constraints imposed by choice probabilities. Unlike Falmagne’s recursive construction, our method leads directly to an explicit solution, obtained after transforming the initial system into an equivalent one via alternating sums, in the spirit of Block–Marschak polynomials. We compute this solution for the Luce model and the generalized extreme value model, and show that, as soon as there are at least four alternatives, the construction based on Shannon entropy is only one among infinitely many possible representations. Other solutions could be obtained by maximizing alternative entropy functions, further highlighting the potential role of information theory in enriching the analysis of stochastic choice.
{"title":"Representing choice probabilities by ranking probabilities via entropy maximization","authors":"Karim Kilani , Hans Colonius","doi":"10.1016/j.jmp.2026.102970","DOIUrl":"10.1016/j.jmp.2026.102970","url":null,"abstract":"<div><div>Falmagne’s representation problem is revisited by maximizing Shannon entropy applied to ranking probabilities, under the linear constraints imposed by choice probabilities. Unlike Falmagne’s recursive construction, our method leads directly to an explicit solution, obtained after transforming the initial system into an equivalent one via alternating sums, in the spirit of Block–Marschak polynomials. We compute this solution for the Luce model and the generalized extreme value model, and show that, as soon as there are at least four alternatives, the construction based on Shannon entropy is only one among infinitely many possible representations. Other solutions could be obtained by maximizing alternative entropy functions, further highlighting the potential role of information theory in enriching the analysis of stochastic choice.</div></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"128 ","pages":"Article 102970"},"PeriodicalIF":1.5,"publicationDate":"2026-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146077915","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-06DOI: 10.1016/j.jmp.2025.102969
Niels van Santen, Yves Rosseel, Daniele Marinazzo
In psychology, as in other sciences, information theory can be used as a tool to complement more standard regression-based methods of data analysis. It is important to see the potential of information theoretical measures as statistical tools without implying a connection to their origins in communication theory and engineering. The use of these measures may provide us with additional insights due to their sensitivity to non-linear relationships, their flexibility to the mixing of data types, and their more straightforward generalization towards investigating higher-order interactions. We briefly reintroduce information theory and compare several measures such as mutual information and co-information with correlation and regression-based methods for the investigation of variable dependence.
{"title":"A hitchhiker’s guide to information theoretical measures in psychology","authors":"Niels van Santen, Yves Rosseel, Daniele Marinazzo","doi":"10.1016/j.jmp.2025.102969","DOIUrl":"10.1016/j.jmp.2025.102969","url":null,"abstract":"<div><div>In psychology, as in other sciences, information theory can be used as a tool to complement more standard regression-based methods of data analysis. It is important to see the potential of information theoretical measures as statistical tools without implying a connection to their origins in communication theory and engineering. The use of these measures may provide us with additional insights due to their sensitivity to non-linear relationships, their flexibility to the mixing of data types, and their more straightforward generalization towards investigating higher-order interactions. We briefly reintroduce information theory and compare several measures such as mutual information and co-information with correlation and regression-based methods for the investigation of variable dependence.</div></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"128 ","pages":"Article 102969"},"PeriodicalIF":1.5,"publicationDate":"2026-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145939428","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-22DOI: 10.1016/j.jmp.2025.102967
Nicholas A. Altieri
Howard and colleagues (2021) reported evidence that significant resources are used to process target-absent information in detection designs. This has major implications for measuring a system’s “capacity”, particularly when using AND decision rules. Chief among these concerns are the inflated capacity measurements commonly reported in the literature. To address this, the authors suggested using a full-factorial identification decision rule instead of simple detection. Here, a new capacity measure is calculated by comparing response times in single-target trials to those obtained from double and target-absent trials. Besides fundamentally altering the design, I argue this newly proposed coefficient may deflate capacity when target-absent responses are systematically slow relative to true parallel independent predictions, or under certain violations of context-invariance. I instead propose comparing responses in the double-target AND condition to parallel independent minimum time predictions derived from single-target “no” trials. This should avoid spurious findings of super or overly limited capacity and thus provide capacity estimates more closely resembling OR detection.
{"title":"Information of absence: Capacity measures for parallel AND processing","authors":"Nicholas A. Altieri","doi":"10.1016/j.jmp.2025.102967","DOIUrl":"10.1016/j.jmp.2025.102967","url":null,"abstract":"<div><div>Howard and colleagues (2021) reported evidence that significant resources are used to process target-absent information in detection designs. This has major implications for measuring a system’s “capacity”, particularly when using AND decision rules. Chief among these concerns are the inflated capacity measurements commonly reported in the literature. To address this, the authors suggested using a full-factorial identification decision rule instead of simple detection. Here, a new capacity measure is calculated by comparing response times in single-target trials to those obtained from double and target-absent trials. Besides fundamentally altering the design, I argue this newly proposed coefficient may deflate capacity when target-absent responses are systematically slow relative to true parallel independent predictions, or under certain violations of context-invariance. I instead propose comparing responses in the double-target AND condition to parallel independent minimum time predictions derived from single-target “no” trials. This should avoid spurious findings of super or overly limited capacity and thus provide capacity estimates more closely resembling OR detection.</div></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"128 ","pages":"Article 102967"},"PeriodicalIF":1.5,"publicationDate":"2025-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145840947","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-18DOI: 10.1016/j.jmp.2025.102968
Han L.J. van der Maas, Lourens Waldorp
The connectivity hypothesis, central to the increasingly influential symptom network approach to psychopathology, proposes that stronger connectivity among symptoms heightens vulnerability to mental disorders. We provide an analytic derivation of this hypothesis using mean-field Ising models of depression, both in the standard formulation and in a variant where nodes represent symptoms as absent or present. Applying bifurcation theory, we derive the bifurcation sets and phase transition structure directly from the mean-field equations. This formal characterization elucidates how connectivity shapes system dynamics and, consistent with the network theory of mental disorders, demonstrates that increasing connectivity amplifies the risk of transitions into unhealthy states.
{"title":"Analytical bifurcation analysis of mean-field Ising models reveals connectivity as a risk factor for psychopathology","authors":"Han L.J. van der Maas, Lourens Waldorp","doi":"10.1016/j.jmp.2025.102968","DOIUrl":"10.1016/j.jmp.2025.102968","url":null,"abstract":"<div><div>The connectivity hypothesis, central to the increasingly influential symptom network approach to psychopathology, proposes that stronger connectivity among symptoms heightens vulnerability to mental disorders. We provide an analytic derivation of this hypothesis using mean-field Ising models of depression, both in the standard <span><math><mrow><mo>−</mo><mn>1</mn><mo>/</mo><mn>1</mn></mrow></math></span> formulation and in a <span><math><mrow><mn>0</mn><mo>/</mo><mn>1</mn></mrow></math></span> variant where nodes represent symptoms as absent or present. Applying bifurcation theory, we derive the bifurcation sets and phase transition structure directly from the mean-field equations. This formal characterization elucidates how connectivity shapes system dynamics and, consistent with the network theory of mental disorders, demonstrates that increasing connectivity amplifies the risk of transitions into unhealthy states.</div></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"128 ","pages":"Article 102968"},"PeriodicalIF":1.5,"publicationDate":"2025-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145798134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-04DOI: 10.1016/j.jmp.2025.102956
Luca Stefanutti , Andrea Spoto
This article provides initial theoretical results concerning the identifiability of the polytomous local independence model (PoLIM), which is an extension of the basic local independence model (BLIM) to polytomous knowledge structures. It is well-known that the BLIM is not identifiable for graded knowledge structures. This is because there exist parameter transformations, named outcome preserving transformations, that leave unchanged the outcome of the prediction function of the model. In this article a twofold generalization is carried out. On the one side, we extend the notion of gradedness to polytomous structures, and, on the other side, we generalize the outcome preserving transformations to the case of polytomous items. These generalizations lead to the conclusion that the PoLIM is not identifiable for graded polytomous structures. This result generalizes a well-known one with the dichotomous structures. The role of equally informative items in the identifiability of the PoLIM is also investigated. The formal results are accompanied by a numerical example that applies those results to the PoLIM with a concrete polytomous structure that turns out to be graded.
本文给出了关于多局部独立模型（polytomous local independence model, PoLIM）可辨识性的初步理论结果，该模型是基本局部独立模型（BLIM）在多局部知识结构上的扩展。众所周知，对于分级的知识结构，blm是不可识别的。这是因为存在参数转换，称为结果保留转换，使模型的预测函数的结果保持不变。在本文中进行了双重推广。一方面，我们将等级的概念扩展到多同构结构，另一方面，我们将结果保留变换推广到多同构项目的情况。这些归纳得出的结论是，PoLIM不能被分级多层结构识别。这个结果推广了一个众所周知的二分类结构。同样翔实的项目在PoLIM的可识别性的作用也进行了调查。正式的结果伴随着一个数值例子，将这些结果应用于具有具体的多聚体结构的PoLIM，结果是分级的。
{"title":"Identifiability of the polytomous local independence model with graded knowledge structures","authors":"Luca Stefanutti , Andrea Spoto","doi":"10.1016/j.jmp.2025.102956","DOIUrl":"10.1016/j.jmp.2025.102956","url":null,"abstract":"<div><div>This article provides initial theoretical results concerning the identifiability of the polytomous local independence model (PoLIM), which is an extension of the basic local independence model (BLIM) to polytomous knowledge structures. It is well-known that the BLIM is not identifiable for graded knowledge structures. This is because there exist parameter transformations, named outcome preserving transformations, that leave unchanged the outcome of the prediction function of the model. In this article a twofold generalization is carried out. On the one side, we extend the notion of gradedness to polytomous structures, and, on the other side, we generalize the outcome preserving transformations to the case of polytomous items. These generalizations lead to the conclusion that the PoLIM is not identifiable for graded polytomous structures. This result generalizes a well-known one with the dichotomous structures. The role of equally informative items in the identifiability of the PoLIM is also investigated. The formal results are accompanied by a numerical example that applies those results to the PoLIM with a concrete polytomous structure that turns out to be graded.</div></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"128 ","pages":"Article 102956"},"PeriodicalIF":1.5,"publicationDate":"2025-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145665688","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-01DOI: 10.1016/j.jmp.2025.102951
Keith A. Schneider
{"title":"Corrigendum to “An entropy model of decision uncertainty” [Journal of Mathematical Psychology 125 (2025), 102919]","authors":"Keith A. Schneider","doi":"10.1016/j.jmp.2025.102951","DOIUrl":"10.1016/j.jmp.2025.102951","url":null,"abstract":"","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"127 ","pages":"Article 102951"},"PeriodicalIF":1.5,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145684646","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-12-01DOI: 10.1016/j.jmp.2025.102957
Madison D. Paron , James D. Paron , Michael J. Kahana
We propose a comprehensive model of how experiences are encoded and retrieved from memory. At the core of the model is a dynamic retrieval process incorporating two essential mechanisms: iterative retrieval, whereby information is sequentially sampled from memory to access the full history of experiences; and competitive retrieval, whereby the most prominent features in memory inhibit the recollection of other features. Together with context-based encoding, the model quantitatively explains well-known facts about response order and inter-response times in recall experiments. We show that our retrieval process maps closely to existing decision frameworks, such as drift–diffusion models, suggesting that the memory system plays a fundamental role in a wide-ranging set of decision-making settings.
{"title":"A dynamic model of context-based retrieval","authors":"Madison D. Paron , James D. Paron , Michael J. Kahana","doi":"10.1016/j.jmp.2025.102957","DOIUrl":"10.1016/j.jmp.2025.102957","url":null,"abstract":"<div><div>We propose a comprehensive model of how experiences are encoded and retrieved from memory. At the core of the model is a dynamic retrieval process incorporating two essential mechanisms: iterative retrieval, whereby information is sequentially sampled from memory to access the full history of experiences; and competitive retrieval, whereby the most prominent features in memory inhibit the recollection of other features. Together with context-based encoding, the model quantitatively explains well-known facts about response order and inter-response times in recall experiments. We show that our retrieval process maps closely to existing decision frameworks, such as drift–diffusion models, suggesting that the memory system plays a fundamental role in a wide-ranging set of decision-making settings.</div></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"127 ","pages":"Article 102957"},"PeriodicalIF":1.5,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145618015","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-20DOI: 10.1016/j.jmp.2025.102955
Huihua Shi , Bo Wang , Ning Gan , Jinjin Li
Informativeness refers to the extent to which competence states can be inferred from knowledge states by using the equivalence relation induced by problem functions. This concept is closely tied to the minimal or maximal elements within the equivalence classes of skills. This paper primarily explores, within the framework of conjunctive competence models, the relationship between informativeness and floors, which are defined as the greatest lower bounds within these equivalence classes. To represent informativeness, an order embedding between two ordered sets is constructed. Additionally, the study extends its analysis to disjunctive competence models and general competence models. Building on this foundation, we investigate the properties of reducible conjunctive and disjunctive competence models, presenting a method for deriving a unique irreducible domain restriction.
{"title":"On informativeness and reducibility in competence models","authors":"Huihua Shi , Bo Wang , Ning Gan , Jinjin Li","doi":"10.1016/j.jmp.2025.102955","DOIUrl":"10.1016/j.jmp.2025.102955","url":null,"abstract":"<div><div>Informativeness refers to the extent to which competence states can be inferred from knowledge states by using the equivalence relation induced by problem functions. This concept is closely tied to the minimal or maximal elements within the equivalence classes of skills. This paper primarily explores, within the framework of conjunctive competence models, the relationship between informativeness and floors, which are defined as the greatest lower bounds within these equivalence classes. To represent informativeness, an order embedding between two ordered sets is constructed. Additionally, the study extends its analysis to disjunctive competence models and general competence models. Building on this foundation, we investigate the properties of reducible conjunctive and disjunctive competence models, presenting a method for deriving a unique irreducible domain restriction.</div></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"127 ","pages":"Article 102955"},"PeriodicalIF":1.5,"publicationDate":"2025-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145579063","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-18DOI: 10.1016/j.jmp.2025.102954
M. Asunción Lubiano , José García-García , Antonio L. García-Izquierdo , Ana M. Castaño
There is a large literature in psychological and behavioral sciences describing mean difference effect size indices for real-valued data. These indices are essential for integrating results from different studies, diverse types of data, or various rating scales. The emergence of new types and sources of data motivates the need to adapt the existing effect size measures or to develop new ones in order to facilitate the comparison of the observed experimental outcomes. To this purpose, some indices of the Cohen family are to be extended throughout this article in order to deal with interval-valued data by following a distance-based approach and its utility will be illustrated by means of a real-life example where interval-valued responses were collected in a questionnaire.
{"title":"Standardized mean difference effect sizes for interval-valued data. A distance-based approach","authors":"M. Asunción Lubiano , José García-García , Antonio L. García-Izquierdo , Ana M. Castaño","doi":"10.1016/j.jmp.2025.102954","DOIUrl":"10.1016/j.jmp.2025.102954","url":null,"abstract":"<div><div>There is a large literature in psychological and behavioral sciences describing mean difference effect size indices for real-valued data. These indices are essential for integrating results from different studies, diverse types of data, or various rating scales. The emergence of new types and sources of data motivates the need to adapt the existing effect size measures or to develop new ones in order to facilitate the comparison of the observed experimental outcomes. To this purpose, some indices of the Cohen <span><math><mi>d</mi></math></span> family are to be extended throughout this article in order to deal with interval-valued data by following a distance-based approach and its utility will be illustrated by means of a real-life example where interval-valued responses were collected in a questionnaire.</div></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"127 ","pages":"Article 102954"},"PeriodicalIF":1.5,"publicationDate":"2025-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145579064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-11-05DOI: 10.1016/j.jmp.2025.102952
Ritesh K. Malaiya, Richard M. Golden
Meta-reasoning studies investigate the role of metacognitive processes in monitoring the success likelihood of an ongoing Reasoning task expected to require Longer Deliberation Time (RLDT), and accordingly, control further cognitive resource allocation to maximize success likelihood. A Meta-reasoning study may require participants to report their intermediate confidence judgment repeatedly within RLDT, e.g., a response that I am 70% confident that the problem is solvable, requested every 15 s. Based on existing Meta-reasoning studies, the current study first identified a set of observable Meta-reasoning phenomena on how intermediate confidence judgment evolves within RLDT and its impact on response choice and response time. Then, based on identified Meta-reasoning phenomena, certain computational features, serving as guidelines, were proposed to facilitate the construction and evaluation of random walk models describing these phenomena. The Markov Random-Walk formulation of the Drift-Diffusion Model (MR-DDM) and the Quantum Random-Walk Model (QRM) have been widely utilized to model response choice, response time, and intermediate and final confidence judgments in decision-making studies. Hence, the proposed computational features were utilized to evaluate the effectiveness of existing MR-DDM and QRM in describing meta-reasoning processes. Also, potential extensions of MR-DDM and QRM were identified for further empirical investigations. The current study also briefly reviewed an existing Item Response Theory (IRT) based extension of a continuous state continuous time Drift-Diffusion Model, named Q-Diffusion, that has been utilized to model RLDT without explicitly constraining the model to describe Meta-reasoning phenomena. Utilizing insights from Q-Diffusion and proposed computational features, the current study identified potential extensions of the MR-DDM for further empirical investigations.
{"title":"Modeling meta-reasoning processes using diffusion and quantum random walk models","authors":"Ritesh K. Malaiya, Richard M. Golden","doi":"10.1016/j.jmp.2025.102952","DOIUrl":"10.1016/j.jmp.2025.102952","url":null,"abstract":"<div><div>Meta-reasoning studies investigate the role of metacognitive processes in <em>monitoring</em> the success likelihood of an ongoing Reasoning task expected to require Longer Deliberation Time (RLDT), and accordingly, <em>control</em> further cognitive resource allocation to maximize success likelihood. A Meta-reasoning study may require participants to report their intermediate confidence judgment repeatedly within RLDT, e.g., a response that <em>I am 70% confident that the problem is solvable</em>, requested every 15 s. Based on existing Meta-reasoning studies, the current study first identified a set of observable Meta-reasoning phenomena on how intermediate confidence judgment evolves within RLDT and its impact on response choice and response time. Then, based on identified Meta-reasoning phenomena, certain computational features, serving as guidelines, were proposed to facilitate the construction and evaluation of random walk models describing these phenomena. The Markov Random-Walk formulation of the Drift-Diffusion Model (MR-DDM) and the Quantum Random-Walk Model (QRM) have been widely utilized to model response choice, response time, and intermediate and final confidence judgments in decision-making studies. Hence, the proposed computational features were utilized to evaluate the effectiveness of existing MR-DDM and QRM in describing meta-reasoning processes. Also, potential extensions of MR-DDM and QRM were identified for further empirical investigations. The current study also briefly reviewed an existing Item Response Theory (IRT) based extension of a continuous state continuous time Drift-Diffusion Model, named Q-Diffusion, that has been utilized to model RLDT without explicitly constraining the model to describe Meta-reasoning phenomena. Utilizing insights from Q-Diffusion and proposed computational features, the current study identified potential extensions of the MR-DDM for further empirical investigations.</div></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"127 ","pages":"Article 102952"},"PeriodicalIF":1.5,"publicationDate":"2025-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145465505","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号