Journal of Mathematical Psychology最新文献

{"title":"Speeded response tasks with unpredictable deadlines","authors":"Steven P. Blurton ,&nbsp;Jan Feifel ,&nbsp;Matthias Gondan","doi":"10.1016/j.jmp.2023.102776","DOIUrl":"10.1016/j.jmp.2023.102776","url":null,"abstract":"<div><p>In response time (RT) research, it is common to instruct participants to respond as fast and as accurately as possible, which is easily conceived as a contradiction. Participants may overcome this dilemma using a two-fold strategy, with (A) delaying their response until they feel confident that enough information has been sampled, and (B) scheduling the response right before the end of the response window to avoid omissions. The purpose of this strategy is to satisfy the contradictory requirements of the task instructions, but both (A) and (B) may yield a distorted picture of the processing times under investigation. We asked participants to discriminate random dot motion with fixed and variable deadlines for responding. With the exponentially distributed variable deadline, strategic responding is useless because it is impossible to schedule an optimal time point for the response. We present two analyses, a model-free approach that investigates the effect of an unpredictable deadline on standard RT measures, and the fit of an RT model testing for effects of the deadline on specific parameters. Compared to the fixed deadline, faster responses that were less variable across participants were observed under the variable deadline, suggesting that the new paradigm can reduce strategic responding. We demonstrate how to deal with omitted responses and conclude that variable deadlines are a promising tool to exert time pressure in RT experiments and potentially yield better estimates of the underlying processing times.</p></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"115 ","pages":"Article 102776"},"PeriodicalIF":1.8,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41246001","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 representation of interval orders through a bi-utility function","authors":"Yann Rébillé","doi":"10.1016/j.jmp.2023.102778","DOIUrl":"10.1016/j.jmp.2023.102778","url":null,"abstract":"<div><p>The elaboration of preference relations and their representations trace their source to early economic theory. Classical representations of preferences theorems rely on Debreu–Eilenberg’s theorems in the topological setting. An important class of preferences consists of interval orders. A natural question is to achieve a bi-utility representation for interval orders. We suggest to introduce a condition reminiscent of N. Wiener’s early works on the relativeness of positions. We obtain a bi-utility representation through the precedence and succession relations.</p></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"115 ","pages":"Article 102778"},"PeriodicalIF":1.8,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47573527","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":"Modelling constituent order despite symmetric associations in memory","authors":"Jeremy J. Thomas ,&nbsp;Jeremy B. Caplan","doi":"10.1016/j.jmp.2023.102774","DOIUrl":"10.1016/j.jmp.2023.102774","url":null,"abstract":"<div><p><span>Mathematical models<span> of association memory (study AB, given A, recall B) either predict that knowledge for constituent order of a word pair (AB vs. BA) is perfectly unrelated, or completely dependent on knowledge of the pairing itself. Data contradict both predictions; when a pair is remembered, constituent-order is above chance, but still fairly low. Convolution-based models are inherently symmetric and can explain associative symmetry, but cannot discriminate AB from BA. We evaluated four extensions of convolution, where order is incorporated as item features, partial permutations of features, item-position associations, or by adding item and </span></span>position vectors. All approaches could discriminate order within behaviourally observed ranges, without compromising associative symmetry. Only the permutation model could disambiguate AB from BC in double-function lists, as humans can do. It is possible that each of our proposed mechanisms might apply to a different, particular task setting. However, the partial permutation model can thus far explain the broadest set of empirical benchmarks.</p></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"115 ","pages":"Article 102774"},"PeriodicalIF":1.8,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44252599","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 characterization of the existence of succinct linear representation of subset-valuations","authors":"Saša Pekeč","doi":"10.1016/j.jmp.2023.102779","DOIUrl":"10.1016/j.jmp.2023.102779","url":null,"abstract":"<div><p>Decisions that involve bundling or unbundling a large number of objects, such as deciding on the bundle structure or optimizing bundle prices, are based on underlying valuation function over the set of all possible bundles. Given that the number of possible bundles (i.e., subsets of the given set of objects) is exponential in the number of objects, it is important for the decision-maker to be able to represent this valuation function succinctly. Identifying all structural sources of synergy in subset valuations might point to simple and concise representation of the valuation function. We characterize additive and multiplicative representations of synergies in subset valuations and subset utility, which in turn points to necessary and sufficient conditions for a succinct representation of subset valuations to exist.</p></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"115 ","pages":"Article 102779"},"PeriodicalIF":1.8,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44273771","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 illustrated guide to context effects","authors":"Clintin P. Davis-Stober ,&nbsp;A.A.J. Marley ,&nbsp;William J. McCausland ,&nbsp;Brandon M. Turner","doi":"10.1016/j.jmp.2023.102790","DOIUrl":"10.1016/j.jmp.2023.102790","url":null,"abstract":"<div><p><span>Three context effects pertaining to stochastic discrete choice have attracted a lot of attention in Psychology, Economics and Marketing: the similarity effect, the compromise effect and the asymmetric dominance effect. Despite this attention, the existing literature is rife with conflicting definitions and misconceptions. We provide theorems relating different variants of each of the three context effects, and theorems relating the context effects to conditions on discrete choice probabilities, such as random utility, regularity, the constant ratio rule, and simple scalability, that may or may not hold for any given </span>discrete choice model. We show how context effects at the individual level may or may not aggregate to context effects at the population level. Importantly, we offer this work as a guide for researchers to sharpen empirical tests and aid future development of choice models.</p></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"115 ","pages":"Article 102790"},"PeriodicalIF":1.8,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48154358","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 queueing model of visual search","authors":"Yiqi Li ,&nbsp;Martin Schlather ,&nbsp;Edgar Erdfelder","doi":"10.1016/j.jmp.2023.102766","DOIUrl":"10.1016/j.jmp.2023.102766","url":null,"abstract":"<div><p>Understanding how attentional resources are deployed in visual processing is a fundamental and highly debated topic. As an alternative to theoretical models of visual search that propose sequences of separate serial or parallel stages of processing, we suggest a queueing processing structure that entails a serial transition between parallel processing stages. We develop a continuous-time queueing model for standard visual search tasks to formalize and implement this notion. Specified as a finite-time, single-line, multiserver queueing system, the model accounts for both accuracy and response time (RT) data in visual search on a distributional level. It assumes two stages of processing. Visual stimuli first go through a massively parallel preattentive stage of feature encoding. They wait if necessary and then enter a limited-capacity attentive stage serially where multiple processing channels (“servers”) integrate features of several stimuli in parallel. A core feature of our model is the serial transition from the unlimited-capacity preattentive processing stage to the limited-capacity attentive processing stage. It enables asynchronous attentive processing of multiple stimuli in parallel and is more efficient than a simple chain of two successive, strictly parallel processing stages. The model accounts for response errors by means of two underlying mechanisms, namely, imperfect processing of the servers and, in addition, incomplete search adopted by the observer to maximize search efficiency under an accuracy constraint. For statistical inference, we develop a Monte-Carlo-based parameter estimation procedure, using maximum likelihood (ML) estimation for accuracy-related parameters and minimum distance (MD) estimation for RT-related parameters. We fit the model to two large empirical data sets from two types of visual search tasks. The model captures the accuracy rates almost perfectly and the observed RT distributions quite well, indicating a high explanatory power. The number of independent parallel processing channels that explain both data sets best was five. We also perform a Monte-Carlo model uncertainty analysis and show that the model with the correct number of parallel channels is selected for more than 90% of the simulated samples.</p></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"115 ","pages":"Article 102766"},"PeriodicalIF":1.8,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47519339","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":"Modal preference structures","authors":"Davide Carpentiere ,&nbsp;Alfio Giarlotta ,&nbsp;Stephen Watson","doi":"10.1016/j.jmp.2023.102791","DOIUrl":"https://doi.org/10.1016/j.jmp.2023.102791","url":null,"abstract":"<div><p>A total preorder is a transitive and complete binary relation on a set. A modal preference structure of rank <span><math><mi>n</mi></math></span> is a string composed of 2 to the exponent <span><math><mi>n</mi></math></span> binary relations on a set such that there is a family of total preorders that gives all relations by taking intersections and unions. Total preorders are structures of rank zero, <span>NaP</span>-preferences (Giarlotta and Greco, 2013) are structures of rank one, and <span>GNaP</span>-preferences (Carpentiere et al., 2022) are structures of rank two. We characterize modal preference structures of any rank by properties of transitive coherence and mixed completeness. Moreover, we show how to construct structures of a given rank from others of lower rank. Modal preference structures arise in economics and psychology, in the process of aggregating hierarchical judgements of groups of agents, where each of the <span><math><mi>n</mi></math></span> coordinates represents a feature/stage of the decision procedure.</p></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"115 ","pages":"Article 102791"},"PeriodicalIF":1.8,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49864107","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":"Special issue on knowledge structures: Theoretical developments and applications","authors":"Jürgen Heller","doi":"10.1016/j.jmp.2023.102773","DOIUrl":"10.1016/j.jmp.2023.102773","url":null,"abstract":"","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"114 ","pages":"Article 102773"},"PeriodicalIF":1.8,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43922736","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":"Diffusion models with time-dependent parameters: An analysis of computational effort and accuracy of different numerical methods","authors":"Thomas Richter ,&nbsp;Rolf Ulrich ,&nbsp;Markus Janczyk","doi":"10.1016/j.jmp.2023.102756","DOIUrl":"10.1016/j.jmp.2023.102756","url":null,"abstract":"<div><p><span>Drift-diffusion models have become valuable tools in many fields of contemporary psychology and the neurosciences. The present study compares and analyzes different methods (i.e., </span>stochastic differential equation<span>, integral method, Kolmogorov equations, and matrix method) to derive the first-passage time distribution predicted by these models. First, these methods are compared in their accuracy and efficiency. In particular, we address non-standard problems, for example, models with time-dependent drift rates or time-dependent thresholds. Second, a mathematical analysis and a classification of these methods is provided. Finally, we discuss their strengths and caveats.</span></p></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"114 ","pages":"Article 102756"},"PeriodicalIF":1.8,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46665964","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":"Well-graded polytomous knowledge structures","authors":"Wen Sun ,&nbsp;Jinjin Li ,&nbsp;Zhaorong He ,&nbsp;Xun Ge ,&nbsp;Yidong Lin","doi":"10.1016/j.jmp.2023.102770","DOIUrl":"10.1016/j.jmp.2023.102770","url":null,"abstract":"<div><p>Heller (2021) and Stefanutti et al. (2020) provided the mathematical foundation for the generalization of knowledge structure theory (KST) to polytomous items. Based on their works, the well-gradedness can be extended to polytomous knowledge structures. We propose the concepts of discriminative polytomous knowledge structure and well-graded polytomous knowledge structure. Then we show that every well-graded polytomous knowledge structure is discriminative. The basis of any polytomous knowledge space is formed by the collection of all the atoms. We discuss the sufficient and necessary conditions of polytomous knowledge structures to be well-graded polytomous knowledge spaces. Moreover, we provide an example to illustrate that a well-graded polytomous knowledge space is not necessarily a polytomous closure space.</p></div>","PeriodicalId":50140,"journal":{"name":"Journal of Mathematical Psychology","volume":"114 ","pages":"Article 102770"},"PeriodicalIF":1.8,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43018006","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}