Show simple item record

dc.contributor.authorDornhaus, Anna
dc.contributor.authorNagpal, Radhika
dc.contributor.authorRadeva, Tsvetomira T.
dc.contributor.authorLynch, Nancy Ann
dc.contributor.authorSu, Hsin-Hao
dc.date.accessioned2018-09-26T14:08:51Z
dc.date.available2018-09-26T14:08:51Z
dc.date.issued2017-12
dc.date.submitted2017-03
dc.identifier.issn1553-7358
dc.identifier.issn1553-734X
dc.identifier.urihttp://hdl.handle.net/1721.1/118171
dc.description.abstractAdaptive collective systems are common in biology and beyond. Typically, such systems require a task allocation algorithm: a mechanism or rule-set by which individuals select particular roles. Here we study the performance of such task allocation mechanisms measured in terms of the time for individuals to allocate to tasks. We ask: (1) Is task allocation fundamentally difficult, and thus costly? (2) Does the performance of task allocation mechanisms depend on the number of individuals? And (3) what other parameters may affect their efficiency? We use techniques from distributed computing theory to develop a model of a social insect colony, where workers have to be allocated to a set of tasks; however, our model is generalizable to other systems. We show, first, that the ability of workers to quickly assess demand for work in tasks they are not currently engaged in crucially affects whether task allocation is quickly achieved or not. This indicates that in social insect tasks such as thermoregulation, where temperature may provide a global and near instantaneous stimulus to measure the need for cooling, for example, it should be easy to match the number of workers to the need for work. In other tasks, such as nest repair, it may be impossible for workers not directly at the work site to know that this task needs more workers. We argue that this affects whether task allocation mechanisms are under strong selection. Second, we show that colony size does not affect task allocation performance under our assumptions. This implies that when effects of colony size are found, they are not inherent in the process of task allocation itself, but due to processes not modeled here, such as higher variation in task demand for smaller colonies, benefits of specialized workers, or constant overhead costs. Third, we show that the ratio of the number of available workers to the workload crucially affects performance. Thus, workers in excess of those needed to complete all tasks improve task allocation performance. This provides a potential explanation for the phenomenon that social insect colonies commonly contain inactive workers: these may be a ‘surplus’ set of workers that improves colony function by speeding up optimal allocation of workers to tasks. Overall our study shows how limitations at the individual level can affect group level outcomes, and suggests new hypotheses that can be explored empirically.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CCF-0939370)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CCF-1461559)en_US
dc.description.sponsorshipUnited States. Air Force Office of Scientific Research (Grant FA9550-13-1-0042)en_US
dc.publisherPublic Library of Science (PLoS)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1371/JOURNAL.PCBI.1005904en_US
dc.rightsCreative Commons Attribution 4.0 International Licenseen_US
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/en_US
dc.sourcePLoSen_US
dc.titleCosts of task allocation with local feedback: Effects of colony size and extra workers in social insects and other multi-agent systemsen_US
dc.typeArticleen_US
dc.identifier.citationRadeva, Tsvetomira et al. “Costs of Task Allocation with Local Feedback: Effects of Colony Size and Extra Workers in Social Insects and Other Multi-Agent Systems.” Edited by Natalia L. Komarova. PLOS Computational Biology 13, 12 (December 2017): e1005904 © 2017 Radeva et alen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorRadeva, Tsvetomira T.
dc.contributor.mitauthorLynch, Nancy Ann
dc.contributor.mitauthorSu, Hsin-Hao
dc.relation.journalPLOS Computational Biologyen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.date.updated2018-09-19T15:44:30Z
dspace.orderedauthorsRadeva, Tsvetomira; Dornhaus, Anna; Lynch, Nancy; Nagpal, Radhika; Su, Hsin-Haoen_US
dspace.embargo.termsNen_US
dc.identifier.orcidhttps://orcid.org/0000-0003-1261-6681
dc.identifier.orcidhttps://orcid.org/0000-0003-3045-265X
mit.licensePUBLISHER_CCen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record