Controllability of Social Networks and the Strategic Use of Random Information

This work is aimed at studying realistic social control strategies for social networks based on the introduction of random information into the state of selected driver agents. Deliberately exposing selected agents to random information is a technique already experimented in recommender systems or search engines, and represents one of the few options for influencing the behavior of a social context that could be accepted as ethical, could be fully disclosed to members, and does not involve the use of force or of deception. Our research is based on a model of knowledge diffusion applied to a time-varying adaptive network, and considers two well-known strategies for influencing social contexts. One is the selection of few influencers for manipulating their actions in order to drive the whole network to a certain behavior; the other, instead, drives the network behavior acting on the state of a large subset of ordinary, scarcely influencing users. The two approaches have been studied in terms of network and diffusion effects. The network effect is analyzed through the changes induced on network average degree and clustering coefficient, while the diffusion effect is based on two ad-hoc metrics defined to measure the degree of knowledge diffusion and skill level, as well as the polarization of agent interests. The results, obtained through simulations on synthetic networks, show a rich dynamics and strong effects on the communication structure and on the distribution of knowledge and skills, supporting our hypothesis that the strategic use of random information could represent a realistic approach to social network controllability, and that with both strategies, in principle, the control effect could be remarkable

Learning backward induction: a neural network agent approach

This paper addresses the question of whether neural networks (NNs), a realistic cognitive model of human information processing, can learn to backward induce in a two-stage game with a unique subgame-perfect Nash equilibrium. The NNs were found to predict the Nash equilibrium approximately 70% of the time in new games. Similarly to humans, the neural network agents are also found to suffer from subgame and truncation inconsistency, supporting the contention that they are appropriate models of general learning in humans. The agents were found to behave in a bounded rational manner as a result of the endogenous emergence of decision heuristics. In particular a very simple heuristic socialmax, that chooses the cell with the highest social payoff explains their behavior approximately 60% of the time, whereas the ownmax heuristic that simply chooses the cell with the maximum payoff for that agent fares worse explaining behavior roughly 38%, albeit still significantly better than chance. These two heuristics were found to be ecologically valid for the backward induction problem as they predicted the Nash equilibrium in 67% and 50% of the games respectively. Compared to various standard classification algorithms, the NNs were found to be only slightly more accurate than standard discriminant analyses. However, the latter do not model the dynamic learning process and have an ad hoc postulated functional form. In contrast, a NN agent’s behavior evolves with experience and is capable of taking on any functional form according to the universal approximation theorem.

Controversy-seeking fuels rumor-telling activity in polarized opinion networks

Rumors have ignited revolutions, undermined the trust in political parties, or threatened the stability of human societies. Such destructive potential has been significantly enhanced by the development of on-line social networks. Several theoretical and computational studies have been devoted to understanding the dynamics and to control rumor spreading. In the present work, a model of rumor-telling in opinion polarized networks was investigated through extensive computer simulations. The key mechanism is the coupling between ones' opinions and their leaning to spread a given information, either by supporting or opposing its content. We report that a highly modular topology of polarized networks strongly impairs rumor spreading, but the couplings between agent's opinions and their spreading/stifling rates can either further inhibit or, conversely, foster information propagation, depending on the nature of those couplings. In particular, a controversy-seeking mechanism, in which agents are stimulated to postpone their transitions to the stiffer state upon interactions with other agents of confronting opinions, enhances the rumor spreading. Therefore such a mechanism is capable of overcoming the propagation bottlenecks imposed by loosely connected modular structures.Comment: 11 pages, 7 figure

Opinion Polarization by Learning from Social Feedback

We explore a new mechanism to explain polarization phenomena in opinion dynamics in which agents evaluate alternative views on the basis of the social feedback obtained on expressing them. High support of the favored opinion in the social environment, is treated as a positive feedback which reinforces the value associated to this opinion. In connected networks of sufficiently high modularity, different groups of agents can form strong convictions of competing opinions. Linking the social feedback process to standard equilibrium concepts we analytically characterize sufficient conditions for the stability of bi-polarization. While previous models have emphasized the polarization effects of deliberative argument-based communication, our model highlights an affective experience-based route to polarization, without assumptions about negative influence or bounded confidence.Comment: Presented at the Social Simulation Conference (Dublin 2017

Distributed Evaluation and Convergence of Self-Appraisals in Social Networks

We consider in this paper a networked system of opinion dynamics in continuous time, where the agents are able to evaluate their self-appraisals in a distributed way. In the model we formulate, the underlying network topology is described by a rooted digraph. For each ordered pair of agents $(i,j)$, we assign a function of self-appraisal to agent $i$, which measures the level of importance of agent $i$ to agent $j$. Thus, by communicating only with her neighbors, each agent is able to calculate the difference between her level of importance to others and others' level of importance to her. The dynamical system of self-appraisals is then designed to drive these differences to zero. We show that for almost all initial conditions, the trajectory generated by this dynamical system asymptotically converges to an equilibrium point which is exponentially stable

Integrative Use of Information Extraction, Semantic Matchmaking and Adaptive Coupling Techniques in Support of Distributed Information Processing and Decision-Making

In order to press maximal cognitive benefit from their social, technological and informational environments, military coalitions need to understand how best to exploit available information assets as well as how best to organize their socially-distributed information processing activities. The International Technology Alliance (ITA) program is beginning to address the challenges associated with enhanced cognition in military coalition environments by integrating a variety of research and development efforts. In particular, research in one component of the ITA ('Project 4: Shared Understanding and Information Exploitation') is seeking to develop capabilities that enable military coalitions to better exploit and distribute networked information assets in the service of collective cognitive outcomes (e.g. improved decision-making). In this paper, we provide an overview of the various research activities in Project 4. We also show how these research activities complement one another in terms of supporting coalition-based collective cognition

Innovation, generative relationships and scaffolding structures: implications of a complexity perspective to innovation for public and private interventions

The linear model of innovation has been superseded by a variety of theoretical models that view the innovation process as systemic, complex, multi-level, multi-temporal, involving a plurality of heterogeneous economic agents. Accordingly, the emphasis of the policy discourse has changed over time. The focus has shifted from the direct public funding of basic research as an engine of innovation, to the creation of markets for knowledge goods, to, eventually, the acknowledgement that knowledge transfer very often requires direct interactions among innovating actors. In most cases, policy interventions attempt to facilitate the match between “demand” and “supply” of the knowledge needed to innovate. A complexity perspective calls for a different framing, one focused on the fostering of processes characterized by multiple agency levels, multiple temporal scales, ontological uncertainty and emergent outcomes. This contribution explores what it means to design interventions in support of innovation processes inspired by a complex systems perspective. It does so by analyzing two examples of coordinated interventions: a public policy funding innovating networks (with SMEs, research centers and university), and a private initiative, promoted by a network of medium-sized mechanical engineering firms, that supports innovation by means of technology brokerage. Relying on two unique datasets recording the interactions of the organizations involved in these interventions, social network analysis and qualitative research are combined in order to investigate network dynamics and the roles of specific actors in fostering innovation processes. Then, some general implications for the design of coordinated interventions supporting innovation in a complexity perspective are drawn