| 2008 |
|---|
| 10 | EE | Peter L. Bartlett,
Varsha Dani,
Thomas P. Hayes,
Sham Kakade,
Alexander Rakhlin,
Ambuj Tewari:
High-Probability Regret Bounds for Bandit Online Linear Optimization.
COLT 2008: 335-342 |
| 9 | EE | Varsha Dani,
Thomas P. Hayes,
Sham M. Kakade:
Stochastic Linear Optimization under Bandit Feedback.
COLT 2008: 355-366 |
| 2007 |
|---|
| 8 | EE | Varsha Dani,
Thomas P. Hayes,
Sham Kakade:
The Price of Bandit Information for Online Optimization.
NIPS 2007 |
| 2006 |
|---|
| 7 | EE | Varsha Dani,
Thomas P. Hayes:
Robbing the bandit: less regret in online geometric optimization against an adaptive adversary.
SODA 2006: 937-943 |
| 6 | EE | Varsha Dani,
Omid Madani,
David M. Pennock,
Sumit K. Sanghai,
Brian Galebach:
An Empirical Comparison of Algorithms for Aggregating Expert Predictions.
UAI 2006 |
| 5 | EE | Varsha Dani,
Thomas P. Hayes:
How to Beat the Adaptive Multi-Armed Bandit
CoRR abs/cs/0602053: (2006) |
| 4 | EE | Varsha Dani:
Review of "Fair Division and Collective Welfare by Hervé Moulin", MIT Press, 2003.
SIGACT News 37(2): 12-17 (2006) |
| 2005 |
|---|
| 3 | EE | Alina Beygelzimer,
Varsha Dani,
Thomas P. Hayes,
John Langford,
Bianca Zadrozny:
Error limiting reductions between classification tasks.
ICML 2005: 49-56 |
| 2 | EE | Ivona Bezáková,
Varsha Dani:
Allocating indivisible goods.
SIGecom Exchanges 5(3): 11-18 (2005) |
| 2004 |
|---|
| 1 | EE | Alina Beygelzimer,
Varsha Dani,
Thomas P. Hayes,
John Langford:
Reductions Between Classification Tasks
Electronic Colloquium on Computational Complexity (ECCC)(077): (2004) |
