scientific article

zbMath1222.68210MaRDI QIDQ3174159

György Ottucsák, András György, Tamás Linder, Gábor Lugosi

Publication date: 12 October 2011

Full work available at URL: http://www.jmlr.org/papers/v8/gyoergy07a.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

shortest path problemon-line learningmulti-armed bandit problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Games involving graphs (91A43)

Related Items (7)

Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems ⋮ Combinatorial bandits ⋮ The covering Canadian traveller problem ⋮ Randomized prediction of individual sequences ⋮ Sensor networks: from dependence analysis via matroid bases to online synthesis ⋮ Bayesian Incentive-Compatible Bandit Exploration ⋮ Online Learning of Nash Equilibria in Congestion Games

This page was built for publication: