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 exhi...
We live in an online world: we date online, we do business online and we communicate online. To make...
When human psychological performance is viewed in terms of cognitive modules, our species displays r...
In this work we consider a bilevel knapsack problem, in which one player, the follower, decides on t...
© 2021 Juan Pablo Franco UlloaHumans are presented daily with decisions that require solving complex...
Execution of complex cognitive tasks is often analyzed as an exercise of infor-mation acquisition an...
Because they provide exclusive property rights, patents are generally considered to be an effective ...
Humans need to solve computationally intractable problems such as visual search, categorization, and...
This study investigated the influence of informational complexity and working memory capacity oil pr...
A small computer model demonstrates that an appropriate organization of boundedly rational individua...
This paper argues that human cognition is structured to sup-port solving in unmanageably large probl...
The future is uncertain because some forthcoming events are unpredictable and also because our abili...
The knapsack problem is a classical optimization problem in which an optimum set of items is chosen ...
When human psychological performance is viewed in terms of cognitive modules, our species displays r...
Humans need to solve computationally intractable problems such as visual search, categorization, and...
A fascinating exploration of how insights from computer algorithms can be applied to our everyday li...
We live in an online world: we date online, we do business online and we communicate online. To make...
When human psychological performance is viewed in terms of cognitive modules, our species displays r...
In this work we consider a bilevel knapsack problem, in which one player, the follower, decides on t...
© 2021 Juan Pablo Franco UlloaHumans are presented daily with decisions that require solving complex...
Execution of complex cognitive tasks is often analyzed as an exercise of infor-mation acquisition an...
Because they provide exclusive property rights, patents are generally considered to be an effective ...
Humans need to solve computationally intractable problems such as visual search, categorization, and...
This study investigated the influence of informational complexity and working memory capacity oil pr...
A small computer model demonstrates that an appropriate organization of boundedly rational individua...
This paper argues that human cognition is structured to sup-port solving in unmanageably large probl...
The future is uncertain because some forthcoming events are unpredictable and also because our abili...
The knapsack problem is a classical optimization problem in which an optimum set of items is chosen ...
When human psychological performance is viewed in terms of cognitive modules, our species displays r...
Humans need to solve computationally intractable problems such as visual search, categorization, and...
A fascinating exploration of how insights from computer algorithms can be applied to our everyday li...
We live in an online world: we date online, we do business online and we communicate online. To make...
When human psychological performance is viewed in terms of cognitive modules, our species displays r...
In this work we consider a bilevel knapsack problem, in which one player, the follower, decides on t...