skip to main content


Title: Networked experiments and modeling for producing collective identity in a group of human subjects using an iterative abduction framework
Group or collective identity is an individual’s cognitive, moral, and emotional connection with a broader community, category, practice, or institution. There are many different contexts in which collective identity operates, and a host of application domains where collective identity is important. Collective identity is studied across myriad academic disciplines. Consequently, there is interest in understanding the collective identity formation process. In laboratory and other settings, collective identity is fostered through priming a group of human subjects. However, there have been no works in developing agent-based models for simulating collective identity formation processes. Our focus is understanding a game that is designed to produce collective identity within a group. To study this process, we build an online game platform; perform and analyze controlled laboratory experiments involving teams; build, exercise, and evaluate network-based agent-based models; and form and evaluate hypotheses about collective identity. We conduct these steps in multiple abductive iterations of experiments and modeling to improve our understanding of collective identity as this looping process unfolds. Our work serves as an exemplar of using abductive looping in the social sciences. Findings on collective identity include the observation that increased team performance in the game, resulting in increased monetary earnings for all players, did not produce a measured increase in collective identity among them.  more » « less
Award ID(s):
1916670
NSF-PAR ID:
10203851
Author(s) / Creator(s):
; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ;
Date Published:
Journal Name:
Social network analysis and mining
Volume:
10
ISSN:
1869-5469
Page Range / eLocation ID:
1-43
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
    In anagram games, players are provided with letters for forming as many words as possible over a specified time duration. Anagram games have been used in controlled experiments to study problems such as collective identity, effects of goal setting, internal-external attributions, test anxiety, and others. The majority of work on anagram games involves individual players. Recently, work has expanded to group anagram games where players cooperate by sharing letters. In this work, we analyze experimental data from online social networked experiments of group anagram games. We develop mechanistic and data driven models of human decision-making to predict detailed game player actions (e.g., what word to form next). With these results, we develop a composite agent-based modeling and simulation platform that incorporates the models from data analysis. We compare model predictions against experimental data, which enables us to provide explanations of human decision-making and behavior. Finally, we provide illustrative case studies using agent-based simulations to demonstrate the efficacy of models to provide insights that are beyond those from experiments alone. 
    more » « less
  2. In a group anagram game, players are provided letters to form as many words as possible. They can also request letters from their neighbors and reply to letter requests. Currently, a single agent-based model is produced from all experimental data, with dependence only on number of neighbors. In this work, we build, exercise, and evaluate enhanced agent behavior models for networked group anagram games under an uncertainty quantification framework. Specifically, we cluster game data for players based on their skill levels (forming words, requesting letters, and replying to requests), perform multinomial logistic regression for transition probabilities, and quantify uncertainty within each cluster. The result of this process is a model where players are assigned different numbers of neighbors and different skill levels in the game. We conduct simulations of ego agents with neighbors to demonstrate the efficacy of our proposed methods. 
    more » « less
  3. null (Ed.)
    Web-based interactions allow agents to coordinate and to take actions (change state) jointly, i.e., to participate in collective action such as a protest, facilitating spread of contagion to large groups within networked populations. In game theoretic contexts, coordination requires that agents share common knowledge about each other. Common knowledge emerges within a group when each member knows the states and the types (preferences) of the other members, and critically, each member knows that everyone else has this information. Hence, these models of common knowledge and coordination on communication networks are fundamentally different from influence-based unilateral contagion models, such as those devised by Granovetter and Centola. Common knowledge arises in many settings in practice, yet there are few operational models that can be used to compute contagion dynamics. Moreover, these models utilize different mechanisms for driving contagion. We evaluate the three mechanisms of a common knowledge model that can represent web-based communication among groups of people on Facebook. We evaluate these mechanisms on five social (media) networks with wide-ranging properties. We demonstrate that different mechanisms can produce widely varying behaviors in terms of the extent of contagion spreading and the speed of contagion transmission. 
    more » « less
  4. null (Ed.)
    Web-based interactions allow agents to coordinate and to take actions (change state) jointly, i.e., to participate in collective ac- tion such as a protest, facilitating spread of contagion to large groups within networked populations. In game theoretic contexts, coordination requires that agents share common knowledge about each other. Common knowledge emerges within a group when each member knows the states and the types (preferences) of the other members, and critically, each member knows that everyone else has this information. Hence, these models of common knowledge and coordination on communication networks are fundamentally different from influence-based unilateral contagion models, such as those devised by Granovetter and Centola. Common knowledge arises in many settings in practice, yet there are few operational models that can be used to compute contagion dynamics. Moreover, these models utilize different mechanisms for driving contagion. We evaluate the three mechanisms of a common knowledge model that can represent web-based communication among groups of people on Facebook. We evaluate these mechanisms on ve social (media) networks with wide-ranging properties.We demonstrate that di erent mechanisms can produce widely varying behaviors in terms of the extent of contagion spreading and the speed of contagion transmission. 
    more » « less
  5. Abstract

    This paper introduces a distributed adaptive formation control for large‐scale multi‐agent systems (LS‐MAS) that addresses the heavy computational complexity and communication traffic challenges while directly extending conventional distributed control from small scale to large scale. Specifically, a novel hierarchical game theoretic algorithm is developed to provide a feasible theory foundation for solving LS‐MAS distributed optimal formation problem by effectively integrating the mean‐field game (MFG), the Stackelberg game, and the cooperative game. In particular, LS‐MAS is divided into multiple groups geographically with each having one group leader and a significant amount of followers. Then, a cooperative game is used among multi‐group leaders to formulate distributed inter‐group formation control for leaders. Meanwhile, an MFG is adopted for a large number of intra‐group followers to achieve the collective intra‐group formation while a Stackelberg game is connecting the followers with their corresponding leader within the same group to achieve the overall LS‐MAS multi‐group formation behavior. Moreover, a hybrid actor–critic‐based reinforcement learning algorithm is constructed to learn the solution of the hierarchical game‐based optimal distributed formation control. Finally, to show the effectiveness of the presented schemes, numerical simulations and Lyapunov analysis is performed.

     
    more » « less