The On-Line Shortest Path Problem Under Partial Monitoring
GyörgyAndrás, LinderTamás, LugosiGábor, OttucsàkGyörgy · Journal of Machine Learning Research · 2007
The on-line shortest path problem is considered under various models of partial monitoring. Given a weighted directed acyclic graph whose edge weights can change in an arbitrary (adversarial) way, ...