%0 Journal Article %1 AnBaSze11 %A Antos, A. %A Bartók, G. %A Szepesvári, Cs. %D 2011 %J CoRR %K bandits, bounds, information, learning, minimax online partial theory %T Non-trivial two-armed partial-monitoring games are bandits %V abs/1108.4961 %X We consider online learning in partial-monitoring games against an oblivious adversary. We show that when the number of actions available to the learner is two and the game is nontrivial then it is reducible to a bandit-like game and thus the minimax regret is Theta(T^1/2).

@article{AnBaSze11, abstract = {We consider online learning in partial-monitoring games against an oblivious adversary. We show that when the number of actions available to the learner is two and the game is nontrivial then it is reducible to a bandit-like game and thus the minimax regret is Theta(T^{1/2}).}, added-at = {2020-03-17T03:03:01.000+0100}, author = {Antos, A. and Bart{\'o}k, G. and Szepesv{\'a}ri, {Cs}.}, bibsource = {DBLP, http://dblp.uni-trier.de}, biburl = {https://www.bibsonomy.org/bibtex/2ae4803ccfde15b7dce9194188f851836/csaba}, date-added = {2012-06-03 14:04:57 -0600}, date-modified = {2012-06-06 21:29:55 -0600}, ee = {http://arxiv.org/abs/1108.4961}, interhash = {fd9a7b05eb3acdf9a4bd08f7d637a8c9}, intrahash = {ae4803ccfde15b7dce9194188f851836}, journal = {CoRR}, keywords = {bandits, bounds, information, learning, minimax online partial theory}, pdf = {papers/twoarmed.pdf}, timestamp = {2020-03-17T03:03:01.000+0100}, title = {Non-trivial two-armed partial-monitoring games are bandits}, volume = {abs/1108.4961}, year = 2011 }