Minimizing regret: The general case

DOI10.1006/game.1998.0690zbMath0954.91011OpenAlexW2153129425MaRDI QIDQ1818295

Aldo Rustichini

Publication date: 9 February 2001

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/65ab2fd2014460cae72da80ea9dee2028c712f32

zbMATH Keywords

partial monitoringminimize regret

Mathematics Subject Classification ID

Stochastic games, stochastic differential games (91A15) Multistage and repeated games (91A20)

Related Items (13)

A general internal regret-free strategy ⋮ Belief-based equilibrium ⋮ On a Unified Framework for Approachability with Full or Partial Monitoring ⋮ Approachability with bounded memory ⋮ Approachability with delayed information ⋮ A conversation with James Hannan ⋮ Regret minimization in repeated matrix games with variable stage duration ⋮ Randomized prediction of individual sequences ⋮ Repeated Games with Incomplete Information ⋮ A differential game on Wasserstein space. Application to weak approachability with partial monitoring ⋮ A wide range no-regret theorem ⋮ Calibration and Internal No-Regret with Random Signals ⋮ Partial Monitoring—Classification, Regret Bounds, and Algorithms

Cites Work

• Consistency and cautious fictitious play
• On general minimax theorems
• On repeated games with incomplete information played by non-Bayesian players
• Regret in the on-line decision problem
• How to use expert advice
• On Pseudo-Games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimizing regret: The general case