论文标题
在多代理多选动力学中打破犹豫不决
Breaking indecision in multi-agent, multi-option dynamics
论文作者
论文摘要
在决定难以区分的质量的选择时,一群代理商如何打破犹豫?从蜜蜂和鸟类羊群到细菌,机器人和人类的生物和人工多代理系统,在在表现或群体生存的情况下在选择中选择的情况下,通常需要克服犹豫不决。破坏犹豫也很重要,因为在完全优柔寡断的状态中,代理并不偏向任何特定的选项,因此代理组对其最大敏感,并且容易适应其环境中的输入和变化。在这里,我们开发了一种数学理论,以研究如何破坏犹豫不决的决策。我们的方法是基于模棱两可的和网络分叉理论。我们将犹豫不决的决策模拟为影响网络中的同步破坏,其中每个节点是代理分配给选项的值。首先,我们表明,三种普遍的决策行为,即僵局,共识和情感,是影响网络中完全同步的犹豫不决状态的同步分叉的一般结果。其次,我们表明,影响网络的对称性预测了所有僵局和共识的价值模式以及某些脉冲的价值模式。第三,我们表明也有许多“异国情调”的脉冲价值模式。这些模式通过网络体系结构(通过网络对称性)预测,通过新的破坏同步的分支引理预测。这是应用程序中异国解决方案的第一个示例。新型影响网络模型的数值模拟说明了我们的理论结果。
How does a group of agents break indecision when deciding about options with qualities that are hard to distinguish? Biological and artificial multi-agent systems, from honeybees and bird flocks to bacteria, robots, and humans, often need to overcome indecision when choosing among options in situations in which the performance or even the survival of the group are at stake. Breaking indecision is also important because in a fully indecisive state agents are not biased toward any specific option and therefore the agent group is maximally sensitive and prone to adapt to inputs and changes in its environment. Here, we develop a mathematical theory to study how decisions arise from the breaking of indecision. Our approach is grounded in both equivariant and network bifurcation theory. We model decision from indecision as synchrony-breaking in influence networks in which each node is the value assigned by an agent to an option. First, we show that three universal decision behaviors, namely, deadlock, consensus, and dissensus, are the generic outcomes of synchrony-breaking bifurcations from a fully synchronous state of indecision in influence networks. Second, we show that all deadlock and consensus value patterns and some dissensus value patterns are predicted by the symmetry of the influence networks. Third, we show that there are also many `exotic' dissensus value patterns. These patterns are predicted by network architecture, but not by network symmetries, through a new synchrony-breaking branching lemma. This is the first example of exotic solutions in an application. Numerical simulations of a novel influence network model illustrate our theoretical results.