Chapter

Algorithmic Learning Theory

Volume 6331 of the series Lecture Notes in Computer Science pp 224-238

Toward a Classification of Finite Partial-Monitoring Games

  • Gábor BartókAffiliated withCarnegie Mellon UniversityDepartment of Computing Science, University of Alberta
  • , Dávid PálAffiliated withCarnegie Mellon UniversityDepartment of Computing Science, University of Alberta
  • , Csaba SzepesváriAffiliated withCarnegie Mellon UniversityDepartment of Computing Science, University of Alberta

* Final gross prices may vary according to local VAT.

Get Access

Abstract

In a finite partial-monitoring game against Nature, the Learner repeatedly chooses one of finitely many actions, the Nature responds with one of finitely many outcomes, the Learner suffers a loss and receives feedback signal, both of which are fixed functions of the action and the outcome. The goal of the Learner is to minimize its total cumulative loss. We make progress towards classification of these games based on their minimax expected regret. Namely, we classify almost all games with two outcomes: We show that their minimax expected regret is either zero, \(\widetilde{\Theta}(\sqrt{T})\), Θ(T 2/3), or Θ(T) and we give a simple and efficiently computable classification of these four classes of games. Our hope is that the result can serve as a stepping stone toward classifying all finite partial-monitoring games.