相关论文: Clustered Volatility in Multiagent Dynamics

We discuss a crowd-based theory for describing the collective behavior in Complex Systems comprising multi-agent populations competing for a limited resource. These systems -- whose binary versions we refer to as B-A-R (Binary Agent…

This study proposes a distributed algorithm that makes agents' adaptive grouping entrap multiple targets via automatic decision making, smooth flocking, and well-distributed entrapping. Agents make their own decisions about which targets to…

Bursty dynamics is a common temporal property of various complex systems in Nature but it also characterises the dynamics of human actions and interactions. At the phenomenological level it is a feature of all systems that evolve…

A dynamical model for the distribution of resources between competing agents is studied. While global competition leads to the accumulation of all the resources by a single agent, local competition allows for a wider resource distribution.…

In this paper, we consider the consensus problem of dynamical multiple agents that communicate via a directed moving neighborhood random network. Each agent performs random walk on a weighted directed network. Agents interact with each…

In this chapter we look at one of the canonical driving examples for multi-agent systems: average consensus. In this scenario, a group of agents seek to agree on the average of their initial states. Depending on the particular application,…

In this paper we study multiagent models with time-varying type change. Assume that there exist a closed system of $N$ agents classified into $r$ types according to their states of an internal system; each agent changes its type by an…

Flocking behavior of multiple agents can be widely observed in nature such as schooling fish and flocking birds. Recent literature has proposed the possibility that flocking is possible even only a small fraction of agents are informed of…

We define and study a class of resources allocation processes where $gN$ agents, by repeatedly visiting $N$ resources, try to converge to optimal configuration where each resource is occupied by at most one agent. The process exhibits a…

In this paper, we study which data can be induced by a correlated equilibrium given a known finite simultaneous move game. We assume that an analyst has access to the frequency of each agent's actions but does not have access to the…

We study fixed points of cellular automata with $N$ sites on random sparse graphs. In the large $N$ limit such models are known to exhibit phase transitions, from a ``frozen'' phase, where at most a finite number of sites fluctuate at long…

Chaotic itinerancy is a universal dynamical concept that describes itinerant motion among many different ordered states through chaotic transition in dynamical systems. Unlike the expectation of the prevalence of chaotic itinerancy in…

Relationship between agents can be conveniently represented by graphs. When these relationships have different modalities, they are better modelled by multilayer graphs where each layer is associated with one modality. Such graphs arise…

A system driven in the vicinity of its critical point by varying a relevant field in an arbitrary function of time is a generic system that possesses a long relaxation time compared with the driving time scale and thus represents a large…

The emergence of clustering and coarsening in crowded ensembles of self-propelled agents is studied using a lattice model in one-dimension. The persistent exclusion process, where particles move at directions that change randomly at a low…

Multiagent systems consist of agents that locally exchange information through a physical network subject to a graph topology. Current control methods for networked multiagent systems assume the knowledge of graph topologies in order to…

Gradual advancement of control technology gives rise to the studies of the stability of linear systems. The stability of the linear multiagent system is motivated by increasing utilization of agent dynamics together with the number of…

We consider open multi-agent systems, which are systems subject to frequent arrivals and departures of agents while the studied process takes place. We study the behavior of all-to-all pairwise gossip interactions in such open systems.…

We consider the problem of steering a multi-agent system to multi-consensus, namely a regime where groups of agents agree on a given value which may be different from group to group. We first address the problem by using distributed…

We propose a distributed algorithm for multiagent systems that aim to optimize a common objective when agents differ in their estimates of the objective-relevant state of the environment. Each agent keeps an estimate of the environment and…