Online Allocation with Risk Information

Shigeaki HARADA  Eiji TAKIMOTO  Akira MARUOKA  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E89-D   No.8   pp.2340-2347
Publication Date: 2006/08/01
Online ISSN: 1745-1361
DOI: 10.1093/ietisy/e89-d.8.2340
Print ISSN: 0916-8532
Type of Manuscript: INVITED PAPER (Special Section on Invited Papers from New Horizons in Computing)
Category: 
Keyword: 
online learning,  resource allocation,  Hedge algorithm,  aggregating algorithm,  

Full Text: PDF>>
Buy this Article




Summary: 
We consider the problem of dynamically apportioning resources among a set of options in a worst-case online framework. The model we investigate is a generalization of the well studied online learning model. In particular, we allow the learner to see as additional information how high the risk of each option is. This assumption is natural in many applications like horse-race betting, where gamblers know odds for all options before placing bets. We apply Vovk's Aggregating Algorithm to this problem and give a tight performance bound. The results support our intuition that it is safe to bet more on low-risk options. Surprisingly, the loss bound of the algorithm does not depend on the values of relatively small risks.