Subjective Complexity Under Uncertainty
Complexity of the problem of choosing among uncertain acts is a salient feature of many of the environments in which departures from expected utility theory are observed. I propose and axiomatize a model of choice under uncertainty in which the size of the partition with respect to which an act is measurable arises endogenously as a measure of subjective complexity. I derive a representation of incomplete Simple Bounds preferences in which acts that are complex from the perspective of the decision maker are bracketed by simple acts to which they are related by statewise dominance. The key axioms are motivated by a model of learning from limited data. I then consider choice behavior characterized by a "cautious completion" of Simple Bounds preferences, and discuss the relationship between this model and models of ambiguity aversion. I develop general comparative statics results, and explore applications to portfolio choice, contracting, and insurance choice.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Measuring and Analyzing Subjective Uncertainty in Scientific Communications
Uncertainty of scientific findings are typically reported through statistical metrics such as $p$-values, confidence intervals, etc. The magnitude of this objective uncertainty is reflected in the language used by the au…
Using Subjective Logic to Estimate Uncertainty in Multi-Armed Bandit Problems
The multi-armed bandit problem is a classical decision-making problem where an agent has to learn an optimal action balancing exploration and exploitation. Properly managing this trade-off requires a correct assessment o…
Decision MakingMulti-Armed BanditsSubjective Risk Decomposition: A New View for Uncertainty Quantification
We present a novel viewpoint for uncertainty quantification. Uncertainty measures are not primitives, in need of axioms and argumentation, but instead consequences, of higher-level modelling decisions. We show how episte…
Bayesian Verification under Model Uncertainty
Machine learning enables systems to build and update domain models based on runtime observations. In this paper, we study statistical model checking and runtime verification for systems with this ability. Two challenges …
modelCan machines be uncertain?
The paper investigates whether and how AI systems can realize states of uncertainty. By adopting a functionalist and behavioral perspective, it examines how symbolic, connectionist and hybrid architectures make room for …