Parallel Constraint Satisfaction in Memory-Based Decisions

被引:29
|
作者
Gloeckner, Andreas [1 ]
Hodges, Sara D. [2 ]
机构
[1] Max Planck Inst Res Collect Goods, D-53113 Bonn, Germany
[2] Univ Oregon, Eugene, OR 97403 USA
关键词
memory-based decision making; parallel constraint satisfaction; fast and frugal heuristics; automatic information integration; intuition; STRATEGY SELECTION PROBLEM; WORKING-MEMORY; MODEL; INFORMATION; CHOICE; IGNORANCE; FRUGAL; TIME; CONSISTENCY; JUDGMENTS;
D O I
10.1027/1618-3169/a000084
中图分类号
B84 [心理学];
学科分类号
04 ; 0402 ;
摘要
Three studies sought to investigate decision strategies in memory-based decisions and to test the predictions of the parallel constraint satisfaction (PCS) model for decision making (Glockner & Betsch, 2008). Time pressure was manipulated and the model was compared against simple heuristics (take the best and equal weight) and a weighted additive strategy. From PCS we predicted that fast intuitive decision making is based on compensatory information integration and that decision time increases and confidence decreases with increasing inconsistency in the decision task. In line with these predictions we observed a predominant usage of compensatory strategies under all time-pressure conditions and even with decision times as short as 1.7 s. For a substantial number of participants, choices and decision times were best explained by PCS, but there was also evidence for use of simple heuristics. The time-pressure manipulation did not significantly affect decision strategies. Overall, the results highlight intuitive, automatic processes in decision making and support the idea that human information-processing capabilities are less severely bounded than often assumed.
引用
收藏
页码:180 / 195
页数:16
相关论文
共 50 条
  • [41] Formula dissection: A parallel algorithm for constraint satisfaction
    Reif, John H.
    Kasif, Simon
    Sherlekar, Deepak
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2008, 55 (06) : 1170 - 1177
  • [42] Memory-based stochastic optimization
    Moore, AW
    Schneider, J
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 8: PROCEEDINGS OF THE 1995 CONFERENCE, 1996, 8 : 1066 - 1072
  • [43] Fast and Parallel Decomposition of Constraint Satisfaction Problems
    Gottlob, Georg
    Okulmus, Cem
    Pichler, Reinhard
    PROCEEDINGS OF THE TWENTY-NINTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, : 1155 - 1162
  • [44] Memory-based shallow parsing
    Sang, EFTK
    JOURNAL OF MACHINE LEARNING RESEARCH, 2002, 2 (04) : 559 - 594
  • [45] Memory-based modes of presentation
    Recanati, Francois
    SYNTHESE, 2024, 203 (04)
  • [46] Cell memory-based therapy
    Anjamrooz, Seyed Hadi
    JOURNAL OF CELLULAR AND MOLECULAR MEDICINE, 2015, 19 (11) : 2682 - 2689
  • [47] Memory-Based Sequential Attention
    Stock, Jason
    Anderson, Charles
    GAZE MEETS MACHINE LEARNING WORKSHOP, 2023, 226 : 236 - 252
  • [48] Memory-based approaches and beyond
    Sanford, AJ
    Garrod, SC
    DISCOURSE PROCESSES, 2005, 39 (2-3) : 205 - 224
  • [49] Memory-Based Language Processing
    Stroppa, Nicolas
    MACHINE TRANSLATION, 2006, 20 (02) : 143 - 145
  • [50] Memory-Based Language Processing
    Yvon, Francois
    TRAITEMENT AUTOMATIQUE DES LANGUES, 2006, 47 (02): : 259 - 262