Randomness is inherently imprecise
From MaRDI portal
Publication:2069032
DOI10.1016/j.ijar.2021.06.018OpenAlexW3179556718MaRDI QIDQ2069032
Jasper De Bock, Gert De Cooman
Publication date: 20 January 2022
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.00071
computabilityimprecise probabilitiesgame-theoretic probabilitysupermartingaleinterval forecastalgorithmic random
Related Items
The smallest probability interval a sequence is random for: a study for six types of randomness, On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Imprecise stochastic processes in discrete time: global models, imprecise Markov chains, and ergodic theorems
- Merging of opinions in game-theoretic probability
- An extension of chaotic probability models to real-valued variables
- Prequential randomness and probability
- A frequentist understanding of sets of measures
- Calibration-based empirical probability
- Towards a frequentist theory of upper and lower probability
- Non-additive probabilities in the work of Bernoulli and Lambert
- Mathematical metaphysics of randomness
- Prequential probability: principles and properties
- A representation of partially ordered preferences
- Game-theoretic upper expectations for discrete-time finite-state uncertain processes
- A particular upper expectation as global belief model for discrete-time finite-state uncertain processes
- Average behaviour in discrete-time imprecise Markov chains: a study of weak ergodicity
- Process complexity and effective random tests
- A recursive algorithm for computing inferences in imprecise Markov chains
- Imprecise probability trees: bridging two theories of imprecise probability
- Imprecise continuous-time Markov chains
- Lévy's zero-one law in game-theoretic probability
- Failure of calibration is typical
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- The axioms and algebra of intuitive probability
- Probability and Finance
- Desirability
- Game-theoretic probability
- Lower Previsions
- Algorithmic Randomness and Complexity
- Present Position and Potential Developments: Some Personal Views: Statistical Theory: The Prequential Approach
- IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR
- Self-Calibrating Priors Do Not Exist
- The Well-Calibrated Bayesian
- Rethinking the Foundations of Statistics
- Game‐Theoretic Foundations for Probability and Finance
- Introduction to Imprecise Probabilities
- Upper and Lower Probabilities Induced by a Multivalued Mapping
- On the apparent convergence of relative frequency and its implications
- The definition of random sequences
- On the concept of a random sequence
- Computable randomness is about more than probabilities
