The following pages link to An easier way to calibrate. (Q1818288):
Displayed 16 items.
- Testing theories with learnable and predictive representations (Q617673) (← links)
- Regret minimization in repeated matrix games with variable stage duration (Q926893) (← links)
- A nonmanipulable test (Q1020990) (← links)
- Calibrated learning and correlated equilibrium (Q1378013) (← links)
- Learning, hypothesis testing, and Nash equilibrium. (Q1413211) (← links)
- Regret in the on-line decision problem (Q1818283) (← links)
- A proof of calibration via Blackwell's approachability theorem. (Q1818285) (← links)
- Conditional universal consistency. (Q1818287) (← links)
- Calibrated forecasting and merging (Q1818290) (← links)
- Mostly calibrated (Q2259418) (← links)
- Online calibrated forecasts: memory efficiency versus universality for learning in games (Q2384142) (← links)
- Approachability, regret and calibration: implications and equivalences (Q2438352) (← links)
- Deterministic calibration and Nash equilibrium (Q2462508) (← links)
- Merging and testing opinions (Q2510825) (← links)
- Good Randomized Sequential Probability Forecasting is Always Possible (Q5490618) (← links)
- Indistinguishable predictions and multi-group fair learning (Q6138076) (← links)