Pages that link to "Item:Q1818285"
From MaRDI portal
The following pages link to A proof of calibration via Blackwell's approachability theorem. (Q1818285):
Displaying 12 items.
- Robust option pricing: Hannan and Blackwell meet Black and Scholes (Q281366) (← links)
- A general internal regret-free strategy (Q291209) (← links)
- Statistical calibration: a simplification of Foster's proof (Q732934) (← links)
- Regret minimization in repeated matrix games with variable stage duration (Q926893) (← links)
- Learning, hypothesis testing, and Nash equilibrium. (Q1413211) (← links)
- Approachability of convex sets in generalized quitting games (Q1651293) (← links)
- Smooth calibration, leaky forecasts, finite recall, and Nash dynamics (Q1753290) (← links)
- An easier way to calibrate. (Q1818288) (← links)
- Exponential weight approachability, applications to calibration and regret minimization (Q2342741) (← links)
- Approachability, regret and calibration: implications and equivalences (Q2438352) (← links)
- Repeated Games with Incomplete Information (Q5149732) (← links)
- “Calibeating”: Beating forecasters at their own game (Q6180412) (← links)