posted on 2010-11-30, 00:00authored byConor Mayo-Wilson, Kevin Zollman, David Danks
We evaluate the asymptotic performance of boundedly-rational strategies in multi-armed bandit problems, where performance is measured in
terms of the tendency (in the limit) to play optimal actions in either (i)
isolation or (ii) networks of other learners. We show that, for many strategies commonly employed in economics, psychology, and machine learning,
performance in isolation and performance in networks are essentially unrelated. Our results suggest that the appropriateness of various, common
boundedly-rational strategies depends crucially upon the social context
(if any) in which such strategies are to be employed.