Approachability with delayed information
From MaRDI portal
Publication:894030
Recommendations
- On a unified framework for approachability with full or partial monitoring
- Approachability, regret and calibration: implications and equivalences
- Stochastic games with information lag
- A primal condition for approachability with partial monitoring
- Approachability of convex sets in games with partial monitoring
Cites work
- scientific article; zbMATH DE number 3128728 (Why is no real title available?)
- A Necessary and Sufficient Condition for Approachability
- A Simple Adaptive Procedure Leading to Correlated Equilibrium
- A general internal regret-free strategy
- An analog of the minimax theorem for vector payoffs
- Approachability in a Two-person Game
- Approachability of convex sets in games with partial monitoring
- Approachability with bounded memory
- Calibrated learning and correlated equilibrium
- Calibration with Many Checking Rules
- Conditional universal consistency.
- Delayed-response strategies in repeated games with observation lags
- Internal regret with partial monitoring: calibration-based optimal algorithms
- Minimizing regret: The general case
- Repeated games with incomplete information. With the collaboration of Richard E. Stearns
- Stochastic games with information lag
Cited in
(4)
This page was built for publication: Approachability with delayed information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894030)