Comparing attribute-based and memory-based preferential choice

被引:0
|
作者
Jana B. Jarecki
Jörg Rieskamp
机构
[1] University of Basel,Department of Psychology, Center for Economic Psychology
来源
DECISION | 2022年 / 49卷
关键词
Preferences; Memory; Similarity; Multiattribute choice; Decision-making; Computational model;
D O I
暂无
中图分类号
学科分类号
摘要
Common theories of multiattribute preferential choice predict that people choose options that have on average better attribute values than alternative options. However, following an alternative memory-based view on preferences people might sometimes prefer options that are more similar to memorized options that were experienced positively in the past. In two incentivized preferential choice experiments (N = 32, N = 28), we empirically compare these theoretical accounts, finding support for the memory-based value theory. Computational modeling using predictive model comparison showed that only a few participants could be described by a model that uses sums of subjectively weighted attribute values when experience was available. Most participants’ choices resembled the predictions of the memory-based model, according to which preferences are based on the similarity between novel and old memorized options. Further, people whose experience consisted of direct sensory exposure, like tasting a portion of food, were also those with higher likelihoods of a memory-based process, compared to people whose exposure was indirect. These results highlight the central role of memory and experience in preferential choices and add to the growing evidence for memory and similarity-based processes in the domain of human preferences.
引用
收藏
页码:65 / 90
页数:25
相关论文
共 50 条
  • [41] A memory-based task scheduling algorithm for grid computing based on heterogeneous platform and homogeneous tasks
    Tang, Kunhao
    Jiang, Wei
    Cui, Ruonan
    Wu, Youlong
    INTERNATIONAL JOURNAL OF WEB AND GRID SERVICES, 2020, 16 (03) : 287 - 304
  • [42] Memory-Based Store Price Judgments: The Role of Knowledge and Shopping Experience
    Ofir, Chezy
    Raghubir, Priya
    Brosh, Gili
    Monroe, Kent B.
    Heiman, Amir
    JOURNAL OF RETAILING, 2008, 84 (04) : 414 - 423
  • [43] Multi-level, Memory-based Logic using CMOS Technology
    Dugganapally, Indira Priyadarshini
    Watkins, Steve E.
    Cooper, Benjamin
    2014 IEEE COMPUTER SOCIETY ANNUAL SYMPOSIUM ON VLSI (ISVLSI), 2014, : 584 - 589
  • [44] A Memory-Based Direct-Digital Frequency Synthesizer for Fractional Synchronization
    Ziabakhsh, Soheyl
    Aouini, Sadok
    Gibbins, Robert G.
    Mikkelsen, Matt
    Moslemi-Tabrizi, Sanam
    Ben-Hamida, Naim
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2022, 69 (03) : 899 - 903
  • [45] A Memory-based Multiagent Framework for Adaptive Decision Making Extended Abstract
    Khadka, Shauharda
    Yates, Connor
    Tumer, Kagan
    PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS (AAMAS' 18), 2018, : 1977 - 1979
  • [46] Data remanence effects on memory-based entropy collection for RFID systems
    Nitesh Saxena
    Jonathan Voris
    International Journal of Information Security, 2011, 10
  • [47] Statistically Induced Chunking Recall: A Memory-Based Approach to Statistical Learning
    Isbilen, Erin S.
    McCauley, Stewart M.
    Kidd, Evan
    Christiansen, Morten H.
    COGNITIVE SCIENCE, 2020, 44 (07)
  • [48] Memory-based symmetric raised-cosine keying modulation method
    Guo, Li-Li
    Zhou, Bin
    Yang, Peng
    Sun, Zhi-Guo
    Huanan Ligong Daxue Xuebao/Journal of South China University of Technology (Natural Science), 2012, 40 (09): : 110 - 115
  • [49] Data remanence effects on memory-based entropy collection for RFID systems
    Saxena, Nitesh
    Voris, Jonathan
    INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 2011, 10 (04) : 213 - 222
  • [50] Integrating Fast and Frugal Heuristics with a Model of Memory-based Cue Generation
    Lawrence, Ashley
    Thomas, Rick P.
    Dougherty, Michael R.
    JOURNAL OF BEHAVIORAL DECISION MAKING, 2018, 31 (04) : 487 - 507