Efficient Algorithms for Online Decision Problems (2003)
Cached
Download Links
- [www-math.mit.edu]
- [www.cc.gatech.edu]
- [people.cs.uchicago.edu]
- [ttic.uchicago.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | J. Comput. Syst. Sci |
| Citations: | 102 - 2 self |
BibTeX
@INPROCEEDINGS{Kalai03efficientalgorithms,
author = {Adam Kalai and Santosh Vempala},
title = {Efficient Algorithms for Online Decision Problems},
booktitle = {J. Comput. Syst. Sci},
year = {2003},
pages = {26--40},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In an online decision problem, one makes a sequence of decisions without knowledge of the future. Tools from learning such as Weighted Majority and its many variants [13, 18, 4] demonstrate that online algorithms can perform nearly as well as the best single decision chosen in hindsight, even when there are exponentially many possible decisions. However, the naive application of these algorithms is inefficient for such large problems. For some problems with nice structure, specialized efficient solutions have been developed [10, 16, 17, 6, 3].
