On a unified framework for approachability with full or partial monitoring
From MaRDI portal
(Redirected from Publication:3449449)
Recommendations
- A primal condition for approachability with partial monitoring
- Approachability of convex sets in games with partial monitoring
- Set-valued approachability and online learning with partial monitoring
- A Necessary and Sufficient Condition for Approachability
- An online convex optimization approach to Blackwell's approachability
Cites work
- scientific article; zbMATH DE number 3122013 (Why is no real title available?)
- scientific article; zbMATH DE number 4063438 (Why is no real title available?)
- scientific article; zbMATH DE number 2152346 (Why is no real title available?)
- scientific article; zbMATH DE number 1909499 (Why is no real title available?)
- A Necessary and Sufficient Condition for Approachability
- An analog of the minimax theorem for vector payoffs
- Approachability in a Two-person Game
- Approachability in infinite dimensional spaces
- Approachability of convex sets in games with partial monitoring
- Barycenters in the Wasserstein space
- DETERMINISTIC DIFFERENTIAL GAMES UNDER PROBABILITY KNOWLEDGE OF INITIAL CONDITION
- Gradient flows in Wasserstein spaces and applications to crowd movement
- Internal regret with partial monitoring: calibration-based optimal algorithms
- Minimizing regret: The general case
- On general minimax theorems
- Optimal strategies in repeated games with incomplete information
- Principe du maximum, inégalité de Harnack et unicité du problème de Cauchy pour les opérateurs elliptiques dégénérées
- Probability Inequalities for Sums of Bounded Random Variables
- Repeated games and qualitative differential games: approachability and comparison of strategies
- Strategies for Prediction Under Imperfect Monitoring
- Viability with probabilistic knowledge of initial condition, application to optimal control
Cited in
(11)- Approachability in population games
- A differential game on Wasserstein space. Application to weak approachability with partial monitoring
- Pseudonorm approachability and applications to regret minimization
- Approachability with constraints
- Set-valued approachability and online learning with partial monitoring
- An online convex optimization approach to Blackwell's approachability
- Approachability with delayed information
- A primal condition for approachability with partial monitoring
- A Necessary and Sufficient Condition for Approachability
- Approachability of convex sets in games with partial monitoring
- Opportunistic approachability and generalized no-regret problems
This page was built for publication: On a unified framework for approachability with full or partial monitoring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449449)
