Response-based approachability with applications to generalized no-regret problems

zbMATH Open1360.91024arXiv1312.7658MaRDI QIDQ5502129FDOQ5502129

Authors: Andrey Bernstein, Nahum Shimkin 

Publication date: 17 August 2015

Full work available at URL: https://arxiv.org/abs/1312.7658

Recommendations

• An online convex optimization approach to Blackwell's approachability
• Opportunistic approachability and generalized no-regret problems
• Approachability in Stackelberg stochastic games with vector costs
• Approachability, regret and calibration: implications and equivalences
• Approachability in repeated games: Computational aspects and a Stackelberg variant

zbMATH Keywords

no-regret algorithms

Mathematics Subject Classification ID

Dynamic programming (90C39) 2-person games (91A05) Multistage and repeated games (91A20)

Cited In (10)

• Solving optimization problems with Blackwell approachability
• Exponential weight approachability, applications to calibration and regret minimization
• Set-valued approachability and online learning with partial monitoring
• An online convex optimization approach to Blackwell's approachability
• An Approximate Dynamic Programming Approach to Repeated Games with Vector Losses
• Title not available (Why is that?)
• Approachability in repeated games: Computational aspects and a Stackelberg variant
• Approachability, regret and calibration: implications and equivalences
• Approachability in Stackelberg stochastic games with vector costs
• Opportunistic approachability and generalized no-regret problems

This page was built for publication: Response-based approachability with applications to generalized no-regret problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502129)