The following pages link to Asymptotic calibration (Q4212770):
Displaying 50 items.
- Robust option pricing: Hannan and Blackwell meet Black and Scholes (Q281366) (← links)
- A general internal regret-free strategy (Q291209) (← links)
- Regret matching with finite memory (Q367483) (← links)
- Book review of: Sergiu Hart and Andreu Mas-Colell, Simple adaptive strategies: from regret-matching to uncoupled dynamics (Q485825) (← links)
- Applications of combined financial strategies based on universal adaptive forecasting (Q505300) (← links)
- Note on universal conditional consistency (Q532666) (← links)
- Testing theories with learnable and predictive representations (Q617673) (← links)
- Nonmanipulable Bayesian testing (Q643273) (← links)
- Statistical calibration: a simplification of Foster's proof (Q732934) (← links)
- On universal algorithms for adaptive forecasting (Q764391) (← links)
- Regret minimization in repeated matrix games with variable stage duration (Q926893) (← links)
- Leading strategies in competitive on-line prediction (Q950203) (← links)
- Exponential weight algorithm in continuous time (Q959954) (← links)
- Supermartingales in prediction with expert advice (Q982635) (← links)
- A payoff-based learning procedure and its application to traffic games (Q993787) (← links)
- On calibration error of randomized forecasting algorithms (Q1017657) (← links)
- A nonmanipulable test (Q1020990) (← links)
- Learning, hypothesis testing, and Nash equilibrium. (Q1413211) (← links)
- Two information aggregation mechanisms for predicting the opening weekend box office revenues of films: boxoffice prophecy and guess of guesses (Q1695307) (← links)
- Safe probability (Q1698993) (← links)
- Randomized prediction of individual sequences (Q1733293) (← links)
- Smooth calibration, leaky forecasts, finite recall, and Nash dynamics (Q1753290) (← links)
- Special issue: Learning in games: a symposium in honor of David Blackwell. (Q1818282) (← links)
- Regret in the on-line decision problem (Q1818283) (← links)
- A proof of calibration via Blackwell's approachability theorem. (Q1818285) (← links)
- Adaptive game playing using multiplicative weights (Q1818286) (← links)
- Belief-based equilibrium (Q1885429) (← links)
- Transferable deposits as a screening mechanism (Q2061116) (← links)
- On the empirical relevance of correlated equilibrium (Q2095259) (← links)
- An axiomatic characterization of wagering mechanisms (Q2253844) (← links)
- Mostly calibrated (Q2259418) (← links)
- On comparison of experts (Q2278913) (← links)
- On the stability of an adaptive learning dynamics in traffic games (Q2319665) (← links)
- Exponential weight approachability, applications to calibration and regret minimization (Q2342741) (← links)
- Online calibrated forecasts: memory efficiency versus universality for learning in games (Q2384142) (← links)
- Failure of calibration is typical (Q2435755) (← links)
- Approachability, regret and calibration: implications and equivalences (Q2438352) (← links)
- Deterministic calibration and Nash equilibrium (Q2462508) (← links)
- Non-asymptotic calibration and resolution (Q2465038) (← links)
- Merging and testing opinions (Q2510825) (← links)
- Near-optimal no-regret algorithms for zero-sum games (Q2516247) (← links)
- Learning hurdles for sleeping experts (Q2826040) (← links)
- Restriction access (Q2826041) (← links)
- Mechanism design with approximate valuations (Q2826042) (← links)
- Quantum strategic game theory (Q2826043) (← links)
- The curse of simultaneity (Q2826044) (← links)
- No justified complaints (Q2826045) (← links)
- From randomizing polynomials to parallel algorithms (Q2826046) (← links)
- Practical verified computation with streaming interactive proofs (Q2826047) (← links)
- Paging for multi-core shared caches (Q2826048) (← links)
