@inproceedings{30709cf8cb7a49378813e9bbd2071fc5,
title = "On optimal foraging and multi-armed bandits",
abstract = "We consider two variants of the standard multi-armed bandit problem, namely, the multi-armed bandit problem with transition costs and the multi-armed bandit problem on graphs. We develop block allocation algorithms for these problems that achieve an expected cumulative regret that is uniformly dominated by a logarithmic function of time, and an expected cumulative number of transitions from one arm to another arm uniformly dominated by a double-logarithmic function of time. We observe that the multi-armed bandit problem with transition costs and the associated block allocation algorithm capture the key features of popular animal foraging models in literature.",
author = "Vaibhav Srivastava and Paul Reverdy and Leonard, {Naomi E.}",
year = "2013",
doi = "10.1109/Allerton.2013.6736565",
language = "English (US)",
isbn = "9781479934096",
series = "2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013",
publisher = "IEEE Computer Society",
pages = "494--499",
booktitle = "2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013",
address = "United States",
note = "51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013 ; Conference date: 02-10-2013 Through 04-10-2013",
}