The Shortest Path Problem Under Partial Monitoring
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 468-482
Abstract
No abstract availableKeywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Adaptive Routing Using Expert AdviceThe Computer Journal, 2006
- Minimizing Regret With Label Efficient PredictionIEEE Transactions on Information Theory, 2005
- Efficient Adaptive Algorithms and Minimax Bounds for Zero-Delay Lossy Source CodingIEEE Transactions on Signal Processing, 2004
- Efficient Algorithms for Online Decision ProblemsLecture Notes in Computer Science, 2003
- The Nonstochastic Multiarmed Bandit ProblemSIAM Journal on Computing, 2002
- Measurement and performance of a cognitive packet networkComputer Networks, 2001
- 10.1162/153244303321897654Applied Physics Letters, 2000
- How to use expert adviceJournal of the ACM, 1997
- The Weighted Majority AlgorithmInformation and Computation, 1994
- An analog of the minimax theorem for vector payoffsPacific Journal of Mathematics, 1956