z-logo
open-access-imgOpen Access
Imitation Upper Confidence Bound for Bandits on a Graph
Author(s) -
Andrei Lupu,
Doina Precup
Publication year - 2018
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v32i1.12183
Subject(s) - graph , upper and lower bounds , computer science , imitation , extension (predicate logic) , theoretical computer science , mathematics , mathematical optimization , artificial intelligence , psychology , social psychology , mathematical analysis , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom