Toward a classification of finite partial-monitoring games

DOI10.1016/J.TCS.2012.10.008MaRDI QIDQ1939263zbMATH OpenOpenAlexFDO

Authors András Antos, Gábor Bartók, Dávid Pál, Csaba Szepesvári

Publication date 4 March 2013

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2012.10.008

zbMATH Keywords

imperfect feedbackonline algorithmsonline learningregret analysis

Mathematics Subject Classification ID

Computational learning theory (68Q32) Online algorithms; streaming algorithms (68W27) Rationality and learning in game theory (91A26) Applications of game theory (91A80)

Recommendations

• Toward a classification of finite partial-monitoring games
• Partial monitoring -- classification, regret bounds, and algorithms
• Regret Minimization Under Partial Monitoring
• Partial monitoring with side information
• Regret bounds and minimax policies under partial monitoring

Cited in

(8)

• Minimizing regret: The general case
• Determinacy of games with stochastic eventual perfect monitoring
• Partial monitoring with side information
• Finitely repeated games with monitoring options
• Toward a classification of finite partial-monitoring games
• Partial monitoring -- classification, regret bounds, and algorithms
• Regret Minimization Under Partial Monitoring
• Cleaning up the neighborhood: a full classification for adversarial partial monitoring

This page was built for publication: Toward a classification of finite partial-monitoring games

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