How Humans Solve Complex Problems: The Case of the Knapsack Problem

被引:21
|
作者
Murawski, Carsten [1 ]
Bossaerts, Peter [1 ,2 ]
机构
[1] Univ Melbourne, Dept Finance, Parkville, Vic 3010, Australia
[2] Univ Melbourne, Florey Inst Neurosci & Mental Hlth, Parkville, Vic 3010, Australia
来源
SCIENTIFIC REPORTS | 2016年 / 6卷
关键词
COMPUTATIONAL RATIONALITY; HEURISTICS; ALGORITHMS; ADHD;
D O I
10.1038/srep34851
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Life presents us with problems of varying complexity. Yet, complexity is not accounted for in theories of human decision-making. Here we study instances of the knapsack problem, a discrete optimisation problem commonly encountered at all levels of cognition, from attention gating to intellectual discovery. Complexity of this problem is well understood from the perspective of a mechanical device like a computer. We show experimentally that human performance too decreased with complexity as defined in computer science. Defying traditional economic principles, participants spent effort way beyond the point where marginal gain was positive, and economic performance increased with instance difficulty. Human attempts at solving the instances exhibited commonalities with algorithms developed for computers, although biological resource constraints-limited working and episodic memorieshad noticeable impact. Consistent with the very nature of the knapsack problem, only a minority of participants found the solution-often quickly-but the ones who did appeared not to realise. Substantial heterogeneity emerged, suggesting why prizes and patents, schemes that incentivise intellectual discovery but discourage information sharing, have been found to be less effective than mechanisms that reveal private information, such as markets.
引用
收藏
页数:10
相关论文
共 50 条
  • [1] How Humans Solve Complex Problems: The Case of the Knapsack Problem
    Carsten Murawski
    Peter Bossaerts
    [J]. Scientific Reports, 6
  • [2] How humans solve the frame problem
    Fields, Chris
    [J]. JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE, 2013, 25 (04) : 441 - 456
  • [3] How to solve complex problems with cases
    Voss, A
    [J]. ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 1996, 9 (04) : 377 - 384
  • [4] A Novel Method to Solve Neural Knapsack Problems
    Li, Duanshun
    Liu, Jing
    Lee, Dongeun
    Seyedmazloom, Ali
    Kaushik, Giridhar
    Lee, Kookjin
    Park, Noseong
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
  • [5] How Humans Can Help Computers to Solve an Artificial Problem?
    Beheshti, Seyed Mohammad Reza Saadat
    Liatsis, Panos
    [J]. 2015 INTERNATIONAL CONFERENCE ON SYSTEMS, SIGNALS AND IMAGE PROCESSING (IWSSIP 2015), 2015, : 291 - 294
  • [6] Using stratified sampling to solve the knapsack problem
    Kuznetsov, NY
    [J]. CYBERNETICS AND SYSTEMS ANALYSIS, 1998, 34 (01) : 61 - 68
  • [7] Using stratified sampling to solve the knapsack problem
    N. Yu. Kuznetsov
    [J]. Cybernetics and Systems Analysis, 1998, 34
  • [8] Universal Heuristics: How Do Humans Solve "Unsolvable" Problems?
    Levin, Leonid A.
    [J]. ALGORITHMIC PROBABILITY AND FRIENDS: BAYESIAN PREDICTION AND ARTIFICIAL INTELLIGENCE, 2013, 7070 : 53 - 54
  • [9] FDTD - How complex a problem can we solve?
    Taflove, A
    Piket-May, MJ
    Hagness, SC
    [J]. IEEE ANTENNAS AND PROPAGATION SOCIETY INTERNATIONAL SYMPOSIUM, VOLS 1-4: TRANSMITTING WAVES OF PROGRESS TO THE NEXT MILLENNIUM, 2000, : 1641 - 1641
  • [10] Metaheuristics-based frameworks to solve the knapsack problem
    Jimenez-Castellano, Isela
    Hernandez-Ocana, Betania
    Hernandez-Torruco, Jose
    Chavez-Bosquez, Oscar
    [J]. INGENIERIA UC, 2019, 26 (01): : 31 - 43