A computable von Neumann-Morgenstern representation theorem
From MaRDI portal
Cites work
- A Definition of Subjective Probability
- A representation of partially ordered preferences
- A tutorial on computable analysis
- Algorithmic Randomness
- An Axiomatic Approach to Measurable Utility
- Bayes, bounds, and rational analysis
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Computational rationality: A converging paradigm for intelligence in brains, minds, and machines
- Expected Utility and Continuity
- scientific article; zbMATH DE number 41812 (Why is no real title available?)
- scientific article; zbMATH DE number 1354815 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 2174551 (Why is no real title available?)
- scientific article; zbMATH DE number 3339023 (Why is no real title available?)
- scientific article; zbMATH DE number 3087284 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- Prospect Theory: An Analysis of Decision under Risk
- Radical interpretation
- Risk Aversion in the Small and in the Large
- The Foundations of Causal Decision Theory
- The Oxford handbook of probability and philosophy
- Weak convergence of measures
This page was built for publication: A computable von Neumann-Morgenstern representation theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229560)