Calibration with Many Checking Rules
From MaRDI portal
Recommendations
Cited in
(31)- On calibration error of randomized forecasting algorithms
- A nonmanipulable test
- Calibration-based empirical probability
- Smooth calibration, leaky forecasts, finite recall, and Nash dynamics
- Special issue: Learning in games: a symposium in honor of David Blackwell.
- An easier way to calibrate.
- Belief-based equilibrium
- Transferable deposits as a screening mechanism
- On comparison of experts
- Online calibrated forecasts: memory efficiency versus universality for learning in games
- Failure of calibration is typical
- Approachability, regret and calibration: implications and equivalences
- Non-asymptotic calibration and resolution
- Merging and testing opinions
- A strategy-proof test of portfolio returns
- On Sequences with Non-learnable Subsequences
- Calibration and internal no-regret with random signals
- Well-calibrated, coherent forecasting systems
- Asymptotic calibration
- Any Inspection is Manipulable
- Efficient testing of forecasts
- Note on universal conditional consistency
- Algorithmic Learning Theory
- Probabilistic Forecasts, Calibration and Sharpness
- Good Randomized Sequential Probability Forecasting is Always Possible
- Indistinguishable predictions and multi-group fair learning
- Testing theories with learnable and predictive representations
- Nonmanipulable Bayesian testing
- On universal algorithms for adaptive forecasting
- Approachability with delayed information
- Regret minimization in repeated matrix games with variable stage duration
This page was built for publication: Calibration with Many Checking Rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704118)