Bandit strategies in social search: the case of the DARPA red balloon challenge

Authored by Haohui Chen, Iyad Rahwan, Manuel Cebrian

Date Published: 2016

DOI: 10.1140/epjds/s13688-016-0082-4

Sponsors: No sponsors listed

Platforms: No platforms listed

Model Documentation: Other Narrative Mathematical description

Model Code URLs: Model code not found

Abstract

Collective search for people and information has tremendously benefited from emerging communication technologies that leverage the wisdom of the crowds, and has been increasingly influential in solving time-critical tasks such as the DARPA Network Challenge (DNC, also known as the Red Balloon Challenge). However, while collective search often invests significant resources in encouraging the crowd to contribute new information, the effort invested in verifying this information is comparable, yet often neglected in crowdsourcing models. This paper studies how the exploration-verification trade-off displayed by the teams modulated their success in the DNC, as teams had limited human resources that they had to divide between recruitment (exploration) and verification (exploitation). Our analysis suggests that team performance in the DNC can be modelled as a modified multi-armed bandit (MAB) problem, where information arrives to the team originating from sources of different levels of veracity that need to be assessed in real time. We use these insights to build a data-driven agent-based model, based on the DNC's data, to simulate team performance. The simulation results match the observed teams' behavior and demonstrate how to achieve the best balance between exploration and exploitation for general time-critical collective search tasks.

Tags

Intelligence Exploration