Adaptive Routing Using Expert Advice

Authors:
András György;György Ottucsák
Affiliations:
Informatics Laboratory, Computer and Automation Research Institute of the Hungarian Academy of Sciences, Lágymányosi u. 11, Budapest, Hungary, H-1111;Department of Computer Science and Information Theory, Budapest University of Technology and Economics Magyar tudósok körútja 2, Budapest, Hungary, H-1117
Venue:
The Computer Journal
Year:
2006

Citing 0
Cited 6

Combining multiple heuristics online

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Restart schedules for ensembles of problem instances

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Reinforcement learning-based load shared sequential routing

NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Regret Bounds and Minimax Policies under Partial Monitoring

The Journal of Machine Learning Research
Hannan consistency in on-line learning in case of unbounded losses under partial monitoring

ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
The shortest path problem under partial monitoring

COLT'06 Proceedings of the 19th annual conference on Learning Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Machine learning algorithms for combining expert advice in sequential decision problems are considered. The goal of these algorithms is to perform, for any behavior of the system, asymptotically as well as the best expert. We provide a survey of these algorithms and show how they can be used for adaptive routing in different packet switched networks.