Related papers: Consensus under Persistence Excitation
Considering some predictive mechanisms, we show that ultrafast average-consensus can be achieved in networks of interconnected agents. More specifically, by predicting the dynamics of the network several steps ahead and using this…
The hypothesis that living systems can benefit from operating at the vicinity of critical points has gained momentum in recent years. Criticality may confer an optimal balance between exceedingly ordered and too noisy states. We here…
In this paper, we consider the coordination control of a group of autonomous mobile agents with multiple leaders. Different interconnection topologies are investigated. At first, a necessary and sufficient condition is proved in the case of…
This paper concerns the consensus of discrete-time multi-agent systems with linear or linearized dynamics. An observer-type protocol based on the relative outputs of neighboring agents is proposed. The consensus of such a multi-agent system…
The original Hegselmann-Krause (HK) model comprises a set of $n$ agents characterized by their opinion, a number in $[0,1]$. Agent $i$ updates its opinion $x_i$ via taking the average opinion of its neighbors whose opinion differs by at…
This paper addresses novel consensus problems for multi-agent systems operating in an unreliable environment where adversaries are spreading. The dynamics of the adversarial spreading processes follows the susceptible-infected-recovered…
Gallice and Monz\'on (2019) present a natural environment that sustains full co-operation in one-shot social dilemmas among a finite number of self-interested agents. They demonstrate that in a sequential public goods game, where agents…
We derive fundamental limitations on the performances of intrinsic averaging algorithms in open multi-agent systems, which are systems subject to random arrivals and departures of agents. Each agent holds a value, and their goal is to…
We study environments in which agents are randomly matched to play a Prisoner's Dilemma, and each player observes a few of the partner's past actions against previous opponents. We depart from the existing related literature by allowing a…
In this paper, we consider a leader-following consensus problem of a group of autonomous agents with time-varying coupling delays. Two different cases of coupling topologies are investigated. At first, a necessary and sufficient condition…
The event-triggered consensus problem of first-order multi-agent systems under directed topology is investigated. The event judgements are only implemented at periodic time instants. Under the designed consensus algorithm, the sampling…
Level-1 Consensus is a property of a preference-profile. Intuitively, it means that there exists a preference relation which induces an ordering of all other preferences such that frequent preferences are those that are more similar to it.…
We consider a class of particle systems which appear in various applications such as approximation theory, plasticity, potential theory and space-filling designs. The positions of the particles on the real line are described as a global…
When has an agent converged? Standard models of the reinforcement learning problem give rise to a straightforward definition of convergence: An agent converges when its behavior or performance in each environment state stops changing.…
We study the performance of asymptotic and approximate consensus algorithms under harsh environmental conditions. The asymptotic consensus problem requires a set of agents to repeatedly set their outputs such that the outputs converge to a…
This paper studies the consensus problem of multi-agent systems with asymmetric and reducible topologies. Centralized event-triggered rules are provided so as to reduce the frequency of system's updating. The diffusion coupling feedbacks of…
We study systems of interacting reinforced stochastic processes, where agents' decisions evolve under reinforcement, network-mediated interactions, and environmental influences. In competitive environments with irreducible networks, we…
We prove that large global systems of interacting (non necessarily similar) dynamical units that are coupled by cooperative impulses, recurrently exhibit the so called grand coalition, for which all the units arrive to their respective…
This paper fully studies distributed optimal consensus problem in non-directed dynamical networks. We consider a group of networked agents that are supposed to rendezvous at the optimal point of a collective convex objective function. Each…
We consider communication when there is no agreement about symbols and meanings. We treat it within the framework of reinforcement learning. We apply different reinforcement learning models in our studies and simplify the problem as much as…