Publication:4969141
From MaRDI portal
zbMath1499.68155MaRDI QIDQ4969141
Andrew B. Nobel, Rafael Frongillo
Publication date: 5 October 2020
Full work available at URL: https://jmlr.csail.mit.edu/papers/v21/18-042.html
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
91B26: Auctions, bargaining, bidding and selling, and other market models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Making and Evaluating Point Forecasts
- Asymmetric Least Squares Estimation and Testing
- The quantilogram: with an application to evaluating directional predictability
- Prequential probability: principles and properties
- On prediction of individual sequences
- Regret in the on-line decision problem
- Algorithmic Randomness and Complexity
- Online Learning and Online Convex Optimization
- MEASURES OF THE VALUE OF INFORMATION
- Finite-sample distribution-free inference in linear median regressions under heteroscedasticity and non-linear dependence of unknown form
- Can an individual sequence of zeros and ones be random?
- Some Stochastic Properties of Memoryless Individual Sequences
- The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences
- Эффективная сходимость по вероятности и эргодическая теорема для индивидуальных случайных последовательностей
- Asymptotic Statistics
- Sequential prediction of individual sequences under general loss functions
- Universal prediction
- Strictly Proper Scoring Rules, Prediction, and Estimation
- On the Continuous Fermat-Weber Problem
- Prediction, Learning, and Games
- The definition of random sequences
- Elicitation of Personal Probabilities and Expectations
- Probability theory for the Brier game