The weighted majority algorithm
Information and Computation
A decision-theoretic generalization of on-line learning and an application to boosting
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
The Nonstochastic Multiarmed Bandit Problem
SIAM Journal on Computing
The Value of Knowing a Demand Curve: Bounds on Regret for Online Posted-Price Auctions
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Online learning in online auctions
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Online convex optimization in the bandit setting: gradient descent without a gradient
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Competitive collaborative learning
COLT'05 Proceedings of the 18th annual conference on Learning Theory
An incentive-compatible multi-armed bandit mechanism
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Nonstochastic bandits: Countable decision set, unbounded costs and reactive environments
Theoretical Computer Science
Regret minimization and the price of total anarchy
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Competitive collaborative learning
Journal of Computer and System Sciences
The Price of Malice in Linear Congestion Games
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Adaptive Incentive-Compatible Sponsored Search Auction
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
An adaptive sponsored search mechanism δ-gain truthful in valuation, time, and budget
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
| Hi-index | 0.00 |