András György, Tamás Linder, György Ottucsák. The Shortest Path Problem Under Partial Monitoring. In Gábor Lugosi, Hans-Ulrich Simon, editors, Learning Theory, 19th Annual Conference on Learning Theory, COLT 2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings. Volume 4005 of Lecture Notes in Computer Science, pages 468-482, Springer, 2006. [doi]
@inproceedings{GyorgyLO06,
title = {The Shortest Path Problem Under Partial Monitoring},
author = {András György and Tamás Linder and György Ottucsák},
year = {2006},
doi = {10.1007/11776420_35},
url = {http://dx.doi.org/10.1007/11776420_35},
researchr = {https://researchr.org/publication/GyorgyLO06},
cites = {0},
citedby = {0},
pages = {468-482},
booktitle = {Learning Theory, 19th Annual Conference on Learning Theory, COLT 2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings},
editor = {Gábor Lugosi and Hans-Ulrich Simon},
volume = {4005},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-35294-5},
}