Opinion Dynamics in Social Networks with Hostile Camps: Consensus vs. Polarization

Most of the distributed protocols for multi-agent consensus assume that the agents are mutually cooperative and "trustful," and so the couplings among the agents bring the values of their states closer. Opinion dynamics in social groups, however, require beyond these conventional models due to ubiquitous competition and distrust between some pairs of agents, which are usually characterized by repulsive couplings and may lead to clustering of the opinions. A simple yet insightful model of opinion dynamics with both attractive and repulsive couplings was proposed recently by C. Altafini, who examined first-order consensus algorithms over static signed graphs. This protocol establishes modulus consensus, where the opinions become the same in modulus but may differ in signs. In this paper, we extend the modulus consensus model to the case where the network topology is an arbitrary time-varying signed graph and prove reaching modulus consensus under mild sufficient conditions of uniform connectivity of the graph. For cut-balanced graphs, not only sufficient, but also necessary conditions for modulus consensus are given.Comment: scheduled for publication in IEEE Transactions on Automatic Control, 2016, vol. 61, no. 7 (accepted in August 2015

Data Driven Distributed Bipartite Consensus Tracking for Nonlinear Multiagent Systems via Iterative Learning Control

This article explores a data-driven distributed bipartite consensus tracking (DBCT) problem for discrete-time multi-agent systems (MASs) with coopetition networks under repeatable operations. To solve this problem, a time-varying linearization model along the iteration axis is first established by using the measurement input and output (I/O) data of agents. Then a data-driven distributed bipartite consensus iterative learning control (DBCILC) algorithm is proposed considering both fixed and switching topologies. Compared with existing bipartite consensus, the main characteristic is to construct the proposed control protocol without requiring any explicit or implicit information of MASs’ mathematical model. The difference from existing iterative learning control (ILC) approaches is that both the cooperative interactions and antagonistic interactions, and time-varying switching topologies are considered. Furthermore, through rigorous theoretical analysis, the proposed DBCILC approach can guarantee the bipartite consensus reducing tracking errors in the limited iteration steps. Moreover, although not all agents can receive information from the virtual leader directly, the proposed distributed scheme can maintain the performance and reduce the costs of communication. The results of three examples further illustrate the correctness, effectiveness, and applicability of the proposed algorithm

High-Order Leader-Follower Tracking Control under Limited Information Availability

Limited information availability represents a fundamental challenge for control of multi-agent systems, since an agent often lacks sensing capabilities to measure certain states of its own and can exchange data only with its neighbors. The challenge becomes even greater when agents are governed by high-order dynamics. The present work is motivated to conduct control design for linear and nonlinear high-order leader-follower multi-agent systems in a context where only the first state of an agent is measured. To address this open challenge, we develop novel distributed observers to enable followers to reconstruct unmeasured or unknown quantities about themselves and the leader and on such a basis, build observer-based tracking control approaches. We analyze the convergence properties of the proposed approaches and validate their performance through simulation

Market Driven Multi-domain Network Service Orchestration in 5G Networks

The advent of a new breed of enhanced multimedia services has put network operators into a position where they must support innovative services while ensuring both end-to-end Quality of Service requirements and profitability. Recently, Network Function Virtualization (NFV) has been touted as a cost-effective underlying technology in 5G networks to efficiently provision novel services. These NFV-based services have been increasingly associated with multi-domain networks. However, several orchestration issues, linked to cross-domain interactions and emphasized by the heterogeneity of underlying technologies and administrative authorities, present an important challenge. In this paper, we tackle the cross-domain interaction issue by proposing an intelligent and profitable auction-based approach to allow inter-domains resource allocation

Bounded Confidence under Preferential Flip: A Coupled Dynamics of Structural Balance and Opinions

In this work we study the coupled dynamics of social balance and opinion formation. We propose a model where agents form opinions under bounded confidence, but only considering the opinions of their friends. The signs of social ties -friendships and enmities- evolve seeking for social balance, taking into account how similar agents' opinions are. We consider both the case where opinions have one and two dimensions. We find that our dynamics produces the segregation of agents into two cliques, with the opinions of agents in one clique differing from those in the other. Depending on the level of bounded confidence, the dynamics can produce either consensus of opinions within each clique or the coexistence of several opinion clusters in a clique. For the uni-dimensional case, the opinions in one clique are all below the opinions in the other clique, hence defining a "left clique" and a "right clique". In the two-dimensional case, our numerical results suggest that the two cliques are separated by a hyperplane in the opinion space. We also show that the phenomenon of unidimensional opinions identified by DeMarzo, Vayanos and Zwiebel (Q J Econ 2003) extends partially to our dynamics. Finally, in the context of politics, we comment about the possible relation of our results to the fragmentation of an ideology and the emergence of new political parties.Comment: 8 figures, PLoS ONE 11(10): e0164323, 201

Simplexity: A Hybrid Framework for Managing System Complexity

Knowledge management, management of mission critical systems, and complexity management rely on a triangular support connection. Knowledge management provides ways of creating, corroborating, collecting, combining, storing, transferring, and sharing the know-why and know-how for reactively and proactively handling the challenges of mission critical systems. Complexity management, operating on “complexity” as an umbrella term for size, mass, diversity, ambiguity, fuzziness, randomness, risk, change, chaos, instability, and disruption, delivers support to both knowledge and systems management: on the one hand, support for dealing with the complexity of managing knowledge, i.e., furnishing criteria for a common and operationalized terminology, for dealing with mediating and moderating concepts, paradoxes, and controversial validity, and, on the other hand, support for systems managers coping with risks, lack of transparence, ambiguity, fuzziness, pooled and reciprocal interdependencies (e.g., for attaining interoperability), instability (e.g., downtime, oscillations, disruption), and even disasters and catastrophes. This support results from the evident intersection of complexity management and systems management, e.g., in the shape of complex adaptive systems, deploying slack, establishing security standards, and utilizing hybrid concepts (e.g., hybrid clouds, hybrid procedures for project management). The complexity-focused manager of mission critical systems should deploy an ambidextrous strategy of both reducing complexity, e.g., in terms of avoiding risks, and of establishing a potential to handle complexity, i.e., investing in high availability, business continuity, slack, optimal coupling, characteristics of high reliability organizations, and agile systems. This complexity-focused hybrid approach is labeled “simplexity.” It constitutes a blend of complexity reduction and complexity augmentation, relying on the generic logic of hybrids: the strengths of complexity reduction are capable of compensating the weaknesses of complexity augmentation and vice versa. The deficiencies of prevalent simplexity models signal that this blended approach requires a sophisticated architecture. In order to provide a sound base for coping with the meta-complexity of both complexity and its management, this architecture comprises interconnected components, domains, and dimensions as building blocks of simplexity as well as paradigms, patterns, and parameters for managing simplexity. The need for a balanced paradigm for complexity management, capable of overcoming not only the prevalent bias of complexity reduction but also weaknesses of prevalent concepts of simplexity, serves as the starting point of the argumentation in this chapter. To provide a practical guideline to meet this demand, an innovative model of simplexity is conceived. This model creates awareness for differentiating components, dimensions, and domains of complexity management as well as for various species of interconnectedness, such as the aligned upsizing and downsizing of capacities, the relevance of diversity management (e.g., in terms of deviations and errors), and the scope of risk management instruments. Strategies (e.g., heuristics, step-by-step procedures) and tools for managing simplexity-guided projects are outlined

Safe consensus control of cooperative-competitive multi-agent systems via differential privacy

summary:This paper investigates a safe consensus problem for cooperative-competitive multi-agent systems using a differential privacy (DP) approach. Considering that the agents simultaneously interact cooperatively and competitively, we propose a novel DP bipartite consensus algorithm, which guarantees that the DP strategy only works on competitive pairs of agents. We then prove that the proposed algorithm can achieve the mean square bipartite consensus and $(p,r)$-accuracy. Furthermore, a differential privacy analysis is conducted, which shows that the performance of privacy protection is positively correlated with the number of neighbors. Thus, a practical method is established for the agents to select their own privacy levels. Finally, the simulation results are presented to demonstrate the validity of the proposed safe consensus algorithm

Distributed Model-Free Bipartite Consensus Tracking for Unknown Heterogeneous Multi-Agent Systems with Switching Topology

This paper proposes a distributed model-free adaptive bipartite consensus tracking (DMFABCT) scheme. The proposed scheme is independent of a precise mathematical model, but can achieve both bipartite time-invariant and time-varying trajectory tracking for unknown dynamic discrete-time heterogeneous multi-agent systems (MASs) with switching topology and coopetition networks. The main innovation of this algorithm is to estimate an equivalent dynamic linearization data model by the pseudo partial derivative (PPD) approach, where only the input–output (I/O) data of each agent is required, and the cooperative interactions among agents are investigated. The rigorous proof of the convergent property is given for DMFABCT, which reveals that the trajectories error can be reduced. Finally, three simulations results show that the novel DMFABCT scheme is effective and robust for unknown heterogeneous discrete-time MASs with switching topologies to complete bipartite consensus tracking tasks