Allocation of goods is a key feature in defining the connection between the individual and the collective scale in any society. Both the process by which goods are to be distributed, and the resulting allocation to the members of the society may affect the success of the population as a whole. One of the most striking natural examples of a highly successful cooperative society is the ant colony which often acts as a single superorganism. In particular, each individual within the ant colony has a "communal stomach" which is used to store and share food with the other colony members by mouth to mouth feeding. Sharing food between communal stomachs allows the colony as a whole to get its food requirements and, more so, allows each individual within the colony to reach its nutritional intake target. The vast majority of colony members do not forage independently but obtain their food through secondary interactions in which food is exchanged between individuals. The global effect of this exchange is not well understood. To gain better understanding into this process we used fluorescence imaging to measure how food from a single external source is distributed and mixed within a Camponotus sanctus ant colony. Using entropic measures to quantify food-blending, we show that while collected food flows into all parts of the colony it mixes only partly. We show that mixing is controlled by the ants' interaction rule which implies that only a fraction of the maximal potential is actually transferred. This rule leads to a robust blending process: i.e., neither the exact food volume that is transferred, nor the interaction schedule are essential to generate the global outcome. Finally, we show how the ants' interaction rules may optimize a trade-off between fast dissemination and efficient mixing. Our results regarding the distribution of a single food source provide a baseline for future studies on distributed regulation of multiple food sources in social insect colonies.

Biological systems can share and collectively process information to yield emergent effects, despite inherent noise in communication. While man-made systems often employ intricate structural solutions to overcome noise, the structure of many biological systems is more amorphous. It is not well understood how communication noise may affect the computational repertoire of such groups. To approach this question we consider the basic collective task of rumor spreading, in which information from few knowledgeable sources must reliably flow into the rest of the population. In order to study the effect of communication noise on the ability of groups that lack stable structures to efficiently solve this task, we consider a noisy version of the uniform PULL model. We prove a lower bound which implies that, in the presence of even moderate levels of noise that affect all facets of the communication, no scheme can significantly outperform the trivial one in which agents have to wait until directly interacting with the sources. Our results thus show an exponential separation between the uniform PUSH and PULL communication models in the presence of noise. Such separation may be interpreted as suggesting that, in order to achieve efficient rumor spreading, a system must exhibit either some degree of structural stability or, alternatively, some facet of the communication which is immune to noise. We corroborate our theoretical findings with a new analysis of experimental data regarding recruitment in Cataglyphis Niger desert ants.

Biological systems can share and collectively process information to yield emergent effects, despite inherent noise in communication. While man-made systems often employ intricate structural solutions to overcome noise, the structure of many biological systems is more amorphous. It is not well understood how communication noise may affect the computational repertoire of such groups. To approach this question we consider the basic collective task of rumor spreading, in which information from few knowledgeable sources must reliably flow into the rest of the population. We study the effect of communication noise on the ability of groups that lack stable structures to efficiently solve this task. We present an impossibility result which strongly restricts reliable rumor spreading in such groups. Namely, we prove that, in the presence of even moderate levels of noise that affect all facets of the communication, no scheme can significantly outperform the trivial one in which agents have to wait until directly interacting with the sources-a process which requires linear time in the population size. Our results imply that in order to achieve efficient rumor spread a system must exhibit either some degree of structural stability or, alternatively, some facet of the communication which is immune to noise. We then corroborate this claim by providing new analyses of experimental data regarding recruitment in Cataglyphis niger desert ants. Finally, in light of our theoretical results, we discuss strategies to overcome noise in other biological systems.

To cooperatively carry large food items to the nest, individual ants conform their efforts and coordinate their motion.Throughout this expedition, collective motion is driven both by internal interactions between the carrying ants and a response to newly arrived informed ants that orient the cargo towards the nest.During the transport process, the carrying group must overcome obstacles that block their path to the nest.Here, we investigate the dynamics of cooperative transport, when the motion of the ants is frustrated by a linear obstacle that obstructs the motion of the cargo.The obstacle contains a narrow opening that serves as the only available passage to the nest, and through which single ants can pass but not with the cargo.We provide an analytical model for the ant-cargo system in the constrained environment that predicts a bi-stable dynamic behavior between an oscillatory mode of motion along the obstacle and a convergent mode of motion near the opening.Using both experiments and simulations, we show how for small cargo sizes, the system exhibits spontaneous transitions between these two modes of motion due to fluctuations in the applied force on the cargo.The bi-stability provides two possible problem solving strategies for overcoming the obstacle, either by attempting to pass through the opening, or take large excursions to circumvent the obstacle. Author summaryAmong animal groups, ants hold what may perhaps be the richest repertoire of collective behavior such as trail formation, nest excavation and food dissemination.Of the most intriguing of these behaviors is cooperative food transport, where many ants carry items that individuals cannot move.Using experiments and theory, we study cooperative transport when the motion is frustrated by an obstacle which contains a single narrow opening that leads to the nest.We find that the group exhibits two co-existing modes of motion that allow exploration of possible routes to overcome the obstacle: Either dwelling near the opening and attempting to pass the cargo through, or performing large excursions that can lead to obstacle circumvention.Previous studies have found that co-existing collective dynamic modes emerge when animal groups interact with constraints, however the origin of the phenomena remains unknown.Here, we provide a detailed theoretical

Distributed computing models typically assume reliable communication between processors. While such assumptions often hold for engineered networks, e.g., due to underlying error correction protocols, their relevance to biological systems, wherein messages are often distorted before reaching their destination, is quite limited. In this study we aim at bridging this gap by rigorously analyzing a model of communication in large anonymous populations composed of simple agents which interact through short and highly unreliable messages. We focus on the rumor-spreading problem and the majority-consensus problem, two fundamental tasks in distributed computing, and initiate their study under communication noise. Our model for communication is extremely weak and follows the push gossip communication paradigm: In each synchronous round each agent that wishes to send information delivers a message to a random anonymous agent. This communication is further restricted to contain only one bit (essentially representing an opinion). Lastly, the system is assumed to be so noisy that the bit in each message sent is flipped independently with probability 1/2-ε, for some small Aε >0.

Social animals may share information to obtain a more complete and accurate picture of their surroundings. However, physical constraints on communication limit the flow of information between interacting individuals in a way that can cause an accumulation of errors and deteriorated collective behaviors. Here, we theoretically study a general model of information sharing within animal groups. We take an algorithmic perspective to identify efficient communication schemes that are, nevertheless, economic in terms of communication, memory and individual internal computation. We present a simple and natural algorithm in which each agent compresses all information it has gathered into a single parameter that represents its confidence in its behavior. Confidence is communicated between agents by means of active signaling. We motivate this model by novel and existing empirical evidences for confidence sharing in animal groups. We rigorously show that this algorithm competes extremely well with the best possible algorithm that operates without any computational constraints. We also show that this algorithm is minimal, in the sense that further reduction in communication may significantly reduce performances. Our proofs rely on the Cramér-Rao bound and on our definition of a Fisher Channel Capacity. We use these concepts to quantify information flows within the group which are then used to obtain lower bounds on collective performance. The abstract nature of our model makes it rigorously solvable and its conclusions highly general. Indeed, our results suggest confidence sharing as a central notion in the context of animal communication.

We use distributed computing tools to provide a new perspective on the behavior of cooperative biological ensembles. We introduce the Ants Nearby Treasure Search (ANTS) problem, a generalization of the classical cow-path problem [10, 20, 41, 42], which is relevant for collective foraging in animal groups. In the ANTS problem, k identical (probabilistic) agents, initially placed at some central location, collectively search for a treasure in the two-dimensional plane. The treasure is placed at a target location by an adversary and the goal is to find it as fast as possible as a function of both k and D, where D is the distance between the central location and the target. This is biologically motivated by cooperative, central place foraging, such as performed by ants around their nest. In this type of search there is a strong preference to locate nearby food sources before those that are further away. We focus on trying to find what can be achieved if communication is limited or altogether absent. Indeed, to avoid overlaps agents must be highly dispersed making communication difficult. Furthermore, if the agents do not commence the search in synchrony, then even initial communication is problematic. This holds, in particular, with respect to the question of whether the agents can communicate and conclude their total number, k. It turns out that the knowledge of k by the individual agents is crucial for performance. Indeed, it is a straightforward observation that the time required for finding the treasure is Ω(D + D2/k), and we show in this paper that this bound can be matched if the agents have knowledge of k up to some constant approximation.