On optimal foraging and multi-armed bandits

2013 51st Annual Allerton Conference on Communication, Control, and Computing, Allerton 2013

Volumn , Issue , 2013, Pages 494-499

  Srivastava, Vaibhav ^a   Reverdy, Paul ^a   Leonard, Naomi E ^a  

^a Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

STATISTICS;

BLOCK ALLOCATION; CUMULATIVE NUMBER; FORAGING MODEL; KEY FEATURE; LOGARITHMIC FUNCTIONS; MULTI ARMED BANDIT; MULTI-ARMED BANDIT PROBLEM; TRANSITION COSTS;

PROBABILITY;

EID: 84897584848     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/Allerton.2013.6736565     Document Type: Conference Paper

References (20)

1. S. Bubeck and N. Cesa-Bianchi. Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Machine Learning, 5(1):1-122, 2012
2. T. L. Lai and H. Robbins. Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics, 6(1):4-22, 1985
3. P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of the multiarmed bandit problem. Machine learning, 47(2):235-256, 2002
4. N. Srinivas, A. Krause, S. M. Kakade, and M. Seeger. Informationtheoretic regret bounds for Gaussian process optimization in the bandit setting. IEEE Transactions on Information Theory, 58(5):3250-3265, 2012
5. E. Kaufmann, O. Cappe, and A. Garivier. On Bayesian upper confidence bounds for bandit problems. In Int. Conf. on Artificial Intelligence and Statistics, pages 592-600, La Palma, Canary Islands, Spain, April 2012
6. P. Reverdy, V. Srivastava, and N. E. Leonard. Modeling human decision-making in multi-armed bandits. In Multidisciplinary Conf. on Reinforcement Learning and Decision Making, Princeton, NJ, USA, Oct 2013
7. R. Agrawal, M. V. Hedge, and D. Teneketzis. Asymptotically efficient adaptive allocation rules for the multi-armed bandit problem with switching cost. IEEE Transactions on Automatic Control, 33(10):899-906, 1988
8. R. Kleinberg, A. Niculescu-Mizil, and Y. Sharma. Regret bounds for sleeping experts and bandits. Machine learning, 80(2-3):245-272, 2010
9. G. H. Pyke, H. R. Pulliam, and E. L. Charnov. Optimal foraging: a selective review of theory and tests. Quarterly Review of Biology, pages 137-154, 1977
10. D. W. Stephens, , and J. R. Krebs. Foraging theory. Princeton University Press, 1986
11. G. M. Viswanathan, M. G. E. da Luz, E. P. Raposo, and H. E. Stanley. The Physics of Foraging: An Introduction to Random Searches and Biological Encounters. Cambridge University Press, 2011
12. E. Gelenbe, N. Schmajuk, J. Staddon, and J. Reif. Autonomous search by robots and animals: A survey. Robotics and Autonomous Systems, 22(1):23-34, 1997
13. S. R. X. Dall, L. Giraldeau, O. Olsson, J. M. McNamara, and D. W. Stephens. Information and its use by animals in evolutionary ecology. Trends in Ecology & Evolution, 20(4):187-193, 2005
14. G. M. Viswanathan, S. V. Buldyrev, S. Havlin, M. G. E. da Luz, E. P. Raposo, and H. E. Stanley. Optimizing the success of random searches. Nature, 401(6756):911-914, 1999
15. O. Benichou, C. Loverdo, M. Moreau, and R. Voituriez. Intermittent search strategies. Reviews of Modern Physics, 83(1):81, 2011
16. J. R. Krebs, A. Kacelnik, and P. Taylor. Test of optimal sampling by foraging great tits. Nature, 275(5675):27-31, 1978
17. T. Keasar, E. Rashkovich, D. Cohen, and A. Shmida. Bees in two-armed bandit situations: Foraging choices and possible decision mechanisms. Behavioral Ecology, 13(6):757-765, 2002
18. A. M. Hein and S. A. McKinley. Sensing and decision-making in random search. Proceedings of the National Academy of Sciences, 109(30):12070-12074, 2012
19. S. Thrun, W. Burgard, and D. Fox. Probabilistic Robotics. The MIT Press, 2005
20. P. Reverdy, V. Srivastava, and N. E. Leonard. Modeling human decision-making in generalized Gaussian multi-armed bandits. arXiv preprint arXiv:1307.6134, July 2013.