{"title":"Sense of agency in operations with delays: A free-energy model and application to interface design","authors":"Masaki Isono, Hideyoshi Yanagisawa","doi":"10.1016/j.jmp.2024.102859","DOIUrl":"https://doi.org/10.1016/j.jmp.2024.102859","url":null,"abstract":"<div><p>Action-feedback delay during operation reduces sense of agency (SoA). In this study, using information-theoretic free energy, we formalized a novel mathematical model for explaining the influence of delay on SoA in continuous operations. Based on the mathematical model, we propose that visualization of predicted future outcomes prevents SoA degradation resulting from response delays. Model-based simulations and operational experiments with participants confirmed that operational delay considerably reduces SoA. Furthermore, the proposed visualization mitigates these problems. Our findings support the model-based interface design for continuous operations with delay to prevent SoA degradation.</p></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"120 ","pages":"Article 102859"},"PeriodicalIF":1.8,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0022249624000282/pdfft?md5=75c323c8281f45145f0bdbdaff626730&pid=1-s2.0-S0022249624000282-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140948334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"心理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The generalized Robbins–Monro process and its application to psychophysical experiments for threshold estimation","authors":"Hau-Hung Yang, Yung-Fong Hsu","doi":"10.1016/j.jmp.2024.102855","DOIUrl":"https://doi.org/10.1016/j.jmp.2024.102855","url":null,"abstract":"<div><p>In classical psychophysics, the study of threshold and underlying representations is of theoretical interest, and the relevant issue of finding the stimulus intensity corresponding to a certain threshold level is an important topic. In the literature, researchers have developed various adaptive (also known as ‘up-down’) methods, including the fixed step-size and variable step-size methods, for the estimation of threshold. A common feature of this family of methods is that the stimulus to be assigned to the current trial depends upon the participant’s response in the previous trial(s), and very often a binary response format is adopted. A well-known earlier work of the variable step-size adaptive methods is the Robbins–Monro process (and its accelerated version). However, previous studies have paid little attention to other facets of response variables (in addition to the binary response variable) that could be jointly embedded into the process. This article concerns a generalization of the Robbins–Monro process by incorporating an additional response variable, such as the response time or the response confidence, into the process. We first prove the consistency of the estimator from the generalized method. We then conduct a Monte Carlo simulation study to explore some finite-sample properties of the estimator from the generalized method with either the response time or the response confidence as the variable of interest, and compare its performance with the original method. The results show that the two methods (and their accelerated version) are comparable. The issue of relative efficiency is also discussed.</p></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"120 ","pages":"Article 102855"},"PeriodicalIF":1.8,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140543297","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}
Fred S. Roberts , Clintin P. Davis-Stober , Michel Regenwetter
{"title":"The mathematical psychology of Peter Fishburn","authors":"Fred S. Roberts , Clintin P. Davis-Stober , Michel Regenwetter","doi":"10.1016/j.jmp.2024.102845","DOIUrl":"https://doi.org/10.1016/j.jmp.2024.102845","url":null,"abstract":"","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"120 ","pages":"Article 102845"},"PeriodicalIF":1.8,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140948335","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}
{"title":"On the (non-) reliance on algorithms—A decision-theoretic account","authors":"Bernard Sinclair-Desgagné","doi":"10.1016/j.jmp.2024.102844","DOIUrl":"https://doi.org/10.1016/j.jmp.2024.102844","url":null,"abstract":"<div><p>A wealth of empirical evidence shows that people display opposite behaviors when deciding whether to rely on an algorithm, even if it is inexpensive to do so and using the algorithm should enhance their own performance. This paper develops a formal theory to explain some of these conflicting facts and submit new testable predictions. Drawing from decision analysis, I invoke two key notions: the ‘value of information’ and the ‘value of control’. The value of information matters to users of algorithms like recommender systems and prediction machines, which essentially provide information. I find that ambiguity aversion or a subjective cost of employing an algorithm will tend to decrease the value of algorithmic information, while repeated exposure to an algorithm might not always increase this value. The value of control matters to users who may delegate decision making to an algorithm. I model how, under partial delegation, imperfect understanding of what the algorithm actually does (so the algorithm is in fact a black box) can cause algorithm aversion. Some possible remedies are formulated and discussed.</p></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"119 ","pages":"Article 102844"},"PeriodicalIF":1.8,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140290848","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}
{"title":"Exploring well-gradedness in polytomous knowledge structures","authors":"Bo Wang , Jinjin Li","doi":"10.1016/j.jmp.2024.102840","DOIUrl":"10.1016/j.jmp.2024.102840","url":null,"abstract":"<div><p>Enhancing learning effectiveness and comprehension, well-gradedness plays a crucial role in knowledge structure theory by establishing a systematic and progressive knowledge system. Extensive research has been conducted in this domain, resulting in significant findings. This paper explores the properties of well-gradedness in polytomous knowledge structures, shedding light on both classical confirmations and exceptional cases. A key characteristic of well-gradedness is the presence of adjacent elements within a non-empty family that exhibit a distance of 1. The study investigates various manifestations of well-gradedness, including its discriminative properties and its manifestation in discriminative factorial polytomous structures. Furthermore, intriguing deviations from classical standards in minimal polytomous states are uncovered, revealing unexpected behaviors.</p></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"119 ","pages":"Article 102840"},"PeriodicalIF":1.8,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139475512","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}
{"title":"An accidental image feature that appears but not disappears","authors":"Tadamasa Sawada , Denis Volk","doi":"10.1016/j.jmp.2024.102841","DOIUrl":"https://doi.org/10.1016/j.jmp.2024.102841","url":null,"abstract":"<div><p>A cusp of a curve in a 2D image is an important feature of the curve for visual perception. It is intuitively obvious that the cusp of the 2D curve can be attributed to an angular feature contained in a 3D scene. It is accidental when a space curve with a cusp in a 3D scene is projected to a smooth curve without any cusp in a 2D image. Note that there is also an interesting case in which a smooth space curve without any cusp is accidentally projected to a 2D curve with a cusp. The angle of the cusp of the 2D curve is arbitrary but it is determined by the shape of the space curve. In this study, we will show the necessary and sufficient conditions that are needed to produce a space smooth curve that is projected to a 2D curve with a cusp under both perspective and orthographic projections. We will also show how the angle of the cusp is determined, and that these conditions are only satisfied accidentally.</p></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"119 ","pages":"Article 102841"},"PeriodicalIF":1.8,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139732702","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}
{"title":"A tutorial on Bayesian inference for dynamical modeling of eye-movement control during reading","authors":"Ralf Engbert , Maximilian M. Rabe","doi":"10.1016/j.jmp.2024.102843","DOIUrl":"https://doi.org/10.1016/j.jmp.2024.102843","url":null,"abstract":"<div><p>Dynamical models are crucial for developing process-oriented, quantitative theories in cognition and behavior. Due to the impressive progress in cognitive theory, domain-specific dynamical models are complex, which typically creates challenges in statistical inference. Mathematical models of eye-movement control might be looked upon as a representative case study. In this tutorial, we introduce and analyze the SWIFT model (Engbert et al., 2002; Engbert et al., 2005), a dynamical modeling framework for eye-movement control in reading that was developed to explain all types of saccades observed in experiments from an activation-based approach. We provide an introduction to dynamical modeling, which explains the basic concepts of SWIFT and its statistical inference. We discuss the likelihood function of a simplified version of the SWIFT model as a key foundation for Bayesian parameter estimation (Rabe et al., 2021; Seelig et al., 2019). In posterior predictive checks, we demonstrate that the simplified model can reproduce interindividual differences via parameter variation. All computations in this tutorial are implemented in the <span>R</span>-Language for Statistical Computing and are made publicly available. We expect that the tutorial might be helpful for advancing dynamical models in other areas of cognitive science.</p></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"119 ","pages":"Article 102843"},"PeriodicalIF":1.8,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140069384","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}
Jing-Jing Li , Chengchun Shi , Lexin Li , Anne G.E. Collins
{"title":"Dynamic noise estimation: A generalized method for modeling noise fluctuations in decision-making","authors":"Jing-Jing Li , Chengchun Shi , Lexin Li , Anne G.E. Collins","doi":"10.1016/j.jmp.2024.102842","DOIUrl":"https://doi.org/10.1016/j.jmp.2024.102842","url":null,"abstract":"<div><p>Computational cognitive modeling is an important tool for understanding the processes supporting human and animal decision-making. Choice data in decision-making tasks are inherently noisy, and separating noise from signal can improve the quality of computational modeling. Common approaches to model decision noise often assume constant levels of noise or exploration throughout learning (e.g., the <span><math><mi>ϵ</mi></math></span>-softmax policy). However, this assumption is not guaranteed to hold – for example, a subject might disengage and lapse into an inattentive phase for a series of trials in the middle of otherwise low-noise performance. Here, we introduce a new, computationally inexpensive method to dynamically estimate the levels of noise fluctuations in choice behavior, under a model assumption that the agent can transition between two discrete latent states (e.g., fully engaged and random). Using simulations, we show that modeling noise levels dynamically instead of statically can substantially improve model fit and parameter estimation, especially in the presence of long periods of noisy behavior, such as prolonged lapses of attention. We further demonstrate the empirical benefits of dynamic noise estimation at the individual and group levels by validating it on four published datasets featuring diverse populations, tasks, and models. Based on the theoretical and empirical evaluation of the method reported in the current work, we expect that dynamic noise estimation will improve modeling in many decision-making paradigms over the static noise estimation method currently used in the modeling literature, while keeping additional model complexity and assumptions minimal.</p></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"119 ","pages":"Article 102842"},"PeriodicalIF":1.8,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139985604","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}
Manel Baucells , Michał Lewandowski , Krzysztof Kontek
{"title":"A contextual range-dependent model for choice under risk","authors":"Manel Baucells , Michał Lewandowski , Krzysztof Kontek","doi":"10.1016/j.jmp.2023.102821","DOIUrl":"https://doi.org/10.1016/j.jmp.2023.102821","url":null,"abstract":"<div><p><span>We introduce a context-dependent theory for choice under risk, called range utility theory. It builds on Parducci’s range principle from psychophysics and modifies expected utility by positing that risky prospects are evaluated relative to the range of consequences of all prospects in the decision context. When the context is fixed, choices typically exhibit the four-fold pattern of risk preferences, yet are fully consistent with expected utility (linear in probabilities) without invoking rank-principles. We illustrate this advantage in </span>game theory contexts. As the same time, when the context varies, the relative value of an alternative also does, yielding different forms or preference reversals, some of which have been robustly documented.</p></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"118 ","pages":"Article 102821"},"PeriodicalIF":1.8,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138466883","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}
{"title":"Expressions for Bayesian confidence of drift diffusion observers in fluctuating stimuli tasks","authors":"Joshua Calder-Travis , Rafal Bogacz , Nick Yeung","doi":"10.1016/j.jmp.2023.102815","DOIUrl":"https://doi.org/10.1016/j.jmp.2023.102815","url":null,"abstract":"<div><p>We introduce a new approach to modelling decision confidence, with the aim of enabling computationally cheap predictions while taking into account, and thereby exploiting, trial-by-trial variability in stochastically fluctuating stimuli. Using the framework of the drift diffusion model of decision making, along with time-dependent thresholds and the idea of a Bayesian confidence readout, we derive expressions for the probability distribution over confidence reports. In line with current models of confidence, the derivations allow for the accumulation of “pipeline” evidence that has been received but not processed by the time of response, the effect of drift rate variability, and metacognitive noise. The expressions are valid for stimuli that change over the course of a trial with normally-distributed fluctuations in the evidence they provide. A number of approximations are made to arrive at the final expressions, and we test all approximations via simulation. The derived expressions contain only a small number of standard functions, and require evaluating only once per trial, making trial-by-trial modelling of confidence data in stochastically fluctuating stimuli tasks more feasible. We conclude by using the expressions to gain insight into the confidence of optimal observers, and empirically observed patterns.</p></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"117 ","pages":"Article 102815"},"PeriodicalIF":1.8,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50189497","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}