Seminario Theory-Experimental

Peter Bossaerts

Cambridge University


seminar – 14:30


Many decisions economic agents face are intractable. It is often suggested that people use heuristics to overcome intractability and that the resulting decisions closely approximate optimality. We scrutinize the latter claim using computational complexity theory, which predicts that solutions to certain problems cannot be approximated well. In a laboratory experiment, participants were asked to make decisions in three different settings that varied in the degree to which optimal decisions could be approximated. We find that the quality of decisions of human participants is consistent with the predictions of the theory. Our findings imply that intrinsic properties of decisions can explain decision quality without requiring knowledge of the heuristics decision-makers use, or which cognitive resource constraints they face. Since computational complexity theory is derived for abstract computers (“Turing machines”), we conclude that humans choose as if they were abstract computers.

Bajar pdf
Deja un comentario

Tu dirección de correo electrónico no será publicada. Los campos requeridos están marcados *

Puedes usar las siguientes HTML etiquetas y atributos: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <s> <strike> <strong>

borrar formularioEnviar

Este sitio usa Akismet para reducir el spam. Aprende cómo se procesan los datos de tus comentarios.