In collective decision-making, individuals in a swarm reach consensus on adecision using only local interactions without any centralized control. In the con-text of the best-of-n problem - characterized by n discrete alternatives - it has beenshown that consensus to the best option can be reached if individuals disseminate that option more than the other options. Besides being used as a mechanism tomodulate positive feedback, long dissemination times could potentially also beused in an adversarial way, whereby adversarial swarms could infiltrate the systemand propagate bad decisions using aggressive dissemination strategies. Motivatedby the above scenario, in this paper we propose a bio-inspired defence strategythat allows the swarm to be resilient against options that can be disseminated forlonger times. This strategy mainly consists in reducing the mobility of the agentsthat are associated to options disseminated for a shorter amount of time, allowingthe swarm to converge to this option. We study the effectiveness of this strategyusing two classical decision mechanisms, the voter model and the majority rule,showing that the majority rule is necessary in our setting for this strategy to work.The strategy has also been validated on a real Kilobots experiment.
|Une conférence||GECCO '21: Genetic and Evolutionary Computation Conference|
|période||10/07/21 → 14/07/21|