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 条
  • [21] Study of Memory-based and Visualized Parallel Computing Data Mining System
    Gao, Zhing-heng
    Chen, Kang
    2015 INTERNATIONAL CONFERENCE ON APPLIED MECHANICS AND MECHATRONICS ENGINEERING (AMME 2015), 2015, : 595 - 599
  • [22] Main Memory-Based Algorithms for Efficient Parallel Aggregation for Temporal Databases
    Dengfeng Gao
    Jose Alvin G. Gendrano
    Bongki Moon
    Richard T. Snodgrass
    Minseok Park
    Bruce C. Huang
    Jim M. Rodrigue
    Distributed and Parallel Databases, 2004, 16 : 123 - 163
  • [23] Most people do not ignore salient invalid cues in memory-based decisions
    Christine Platzer
    Arndt Bröder
    Psychonomic Bulletin & Review, 2012, 19 : 654 - 661
  • [24] MEMORY-BASED PARSING
    LEBOWITZ, M
    ARTIFICIAL INTELLIGENCE, 1983, 21 (04) : 363 - 404
  • [25] CONSAT: a parallel constraint satisfaction system
    Ho, Kinson
    Guesgen, Hans W.
    Hilfinger, Paul N.
    LISP and Symbolic Computation, 1994, 7 (2-3): : 195 - 210
  • [26] Domain dependence in parallel constraint satisfaction
    1600, Morgan Kaufmann Publ Inc, San Mateo, CA, USA (01):
  • [27] A TAGGING METHOD FOR PARALLEL CONSTRAINT SATISFACTION
    GUESGEN, HW
    HO, K
    HILFINGER, PN
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1992, 16 (01) : 72 - 75
  • [28] PARALLEL SOLUTIONS TO CONSTRAINT SATISFACTION PROBLEMS
    KASIF, S
    PROCEEDINGS OF THE FIRST CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 1989, : 180 - 188
  • [29] Decomposition techniques for parallel resolution of constraint satisfaction problems in shared memory: a comparative study
    Habbas, Zineb
    Krajecki, Michael
    Singer, Daniel
    INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING, 2005, 1 (2-4) : 192 - 206
  • [30] A New Parallel GA-Based Method for Constraint Satisfaction Problems
    Abbasian, Reza
    Mouhoub, Malek
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE AND APPLICATIONS, 2016, 15 (03)