Recommendations
Cites work
- scientific article; zbMATH DE number 1804105 (Why is no real title available?)
- scientific article; zbMATH DE number 3128728 (Why is no real title available?)
- scientific article; zbMATH DE number 3137856 (Why is no real title available?)
- A Simple Adaptive Procedure Leading to Correlated Equilibrium
- A general class of adaptive strategies
- A proof of calibration via Blackwell's approachability theorem.
- An analog of the minimax theorem for vector payoffs
- Approachability, regret and calibration: implications and equivalences
- Asymptotic calibration
- Calibrated learning and correlated equilibrium
- Calibration and internal no-regret with random signals
- Conditional universal consistency.
- From external to internal regret
- Internal regret in on-line portfolio selection
- Internal regret with partial monitoring: calibration-based optimal algorithms
- Learning Theory and Kernel Machines
- Minimizing regret: The general case
- Partial monitoring -- classification, regret bounds, and algorithms
- Prediction, Learning, and Games
- Regret Minimization Under Partial Monitoring
- Regret in the on-line decision problem
- Repeated games with incomplete information. With the collaboration of Richard E. Stearns
- Strategies for Prediction Under Imperfect Monitoring
Cited in
(9)- Internal regret in on-line portfolio selection
- Approachability with constraints
- Regret in the on-line decision problem
- Internal regret with partial monitoring: calibration-based optimal algorithms
- Internal regret in on-line portfolio selection
- Calibration and internal no-regret with random signals
- Approachability with delayed information
- A wide range no-regret theorem
- Opportunistic approachability and generalized no-regret problems
This page was built for publication: A general internal regret-free strategy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q291209)