Toward a classification of finite partial-monitoring games

DOI10.1016/J.TCS.2012.10.008zbMATH Open1277.68098OpenAlexW2561282814MaRDI QIDQ1939263FDOQ1939263

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

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

zbMATH Keywords

online algorithmsonline learningregret analysisimperfect feedback

Mathematics Subject Classification ID

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

Cited In (6)

• Finitely repeated games with monitoring options
• Regret Minimization Under Partial Monitoring
• Partial monitoring with side information
• Toward a classification of finite partial-monitoring games
• Determinacy of games with stochastic eventual perfect monitoring
• Partial monitoring -- classification, regret bounds, and algorithms

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)