Bounded Rational Decision-Making from Elementary Computations That Reduce Uncertainty
In its most basic form, decision-making can be viewed as a computational process that progressively eliminates alternatives, thereby reducing uncertainty. Such processes are generally costly, meaning that the amount of uncertainty that can be reduced is limited by the amount of available computation...
Main Authors: | Sebastian Gottwald, Daniel A. Braun |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-04-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/21/4/375 |
Similar Items
-
Analyzing Abstraction and Hierarchical Decision-Making in Absolute Identification by Information-Theoretic Bounded Rationality
by: Cecilia Lindig-León, et al.
Published: (2019-11-01) -
Retrospective Inference as a Form of Bounded Rationality, and Its Beneficial Influence on Learning
by: Thomas H. B. FitzGerald, et al.
Published: (2020-02-01) -
Post-decision biases reveal a self-consistency principle in perceptual inference
by: Long Luu, et al.
Published: (2018-05-01) -
Methodological Foundations for Bounded Rationality as a Primary Framework
by: Modarres-Mousavi, Shabnam
Published: (2014) -
Bounded Rationality and Exemplar Models
by: Persson, Magnus
Published: (2003)