Internal Regret with Partial Monitoring. Calibration-Based Optimal Algorithms

zbMath1280.68114arXiv1102.4442MaRDI QIDQ5396662

Vianney Perchet

Publication date: 3 February 2014

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

zbMATH Keywords

repeated gamescalibrationregreton-line learningpartial monitoringVoronoi and Laguerre diagrams

Mathematics Subject Classification ID

Computational learning theory (68Q32) Rationality and learning in game theory (91A26) Multistage and repeated games (91A20)

Related Items (8)

A general internal regret-free strategy ⋮ On a Unified Framework for Approachability with Full or Partial Monitoring ⋮ Approachability of convex sets in generalized quitting games ⋮ Approachability with delayed information ⋮ Approachability, regret and calibration: implications and equivalences ⋮ A primal condition for approachability with partial monitoring ⋮ A differential game on Wasserstein space. Application to weak approachability with partial monitoring ⋮ Partial Monitoring—Classification, Regret Bounds, and Algorithms

This page was built for publication: Internal Regret with Partial Monitoring. Calibration-Based Optimal Algorithms