اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGroup formation with network constraints
166
0
0.0
(
0
)
تأليف
Katharine A. Anderson
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Group formation is important in many economic contexts. The current literature on group formation assumes that individuals may join any existing group. In this paper, I consider the implications of social, geographic, and informational constraints to group membership decisions. I embed the players in a network of relationships, which constrains their choice of groups--they may only join a group if that group contains a member that they are connected to on the network. I then examine how this network constraint affects the equilibrium group structure. I show that even with complete information, unconstrained individuals form groups that are inefficiently large. When individuals are constrained, the resulting group structures are much closer to the socially optimal group structure, because the constraint limits the ability of the individual to free ride on the efforts of other group members. The efficiency of the outcome is related to the structure of the network constraint--outcomes are more efficient when networks are sparse and have few random connections.
قيم البحث
اقرأ أيضاً
Social groups are fundamental building blocks of human societies. While our social interactions have always been constrained by geography, it has been impossible, due to practical difficulties, to evaluate the nature of this restriction on social gro
up structure. We construct a social network of individuals whose most frequent geographical locations are also known. We also classify the individuals into groups according to a community detection algorithm. We study the variation of geographical span for social groups of varying sizes, and explore the relationship between topological positions and geographic positions of their members. We find that small social groups are geographically very tight, but become much more clumped when the group size exceeds about 30 members. Also, we find no correlation between the topological positions and geographic positions of individuals within network communities. These results suggest that spreading processes face distinct structural and spatial constraints.
The spontaneous formation and subsequent growth, dissolution, merger and competition of social groups bears similarities to physical phase transitions in metastable finite systems. We examine three different scenarios, percolation, spinodal decomposi
tion and nucleation, to describe the formation of social groups of varying size and density. In our agent-based model, we use a feedback between the opinions of agents and their ability to establish links. Groups can restrict further link formation, but agents can also leave if costs exceed the group benefits. We identify the critical parameters for costs/benefits and social influence to obtain either one large group or the stable coexistence of several groups with different opinions. Analytic investigations allow to derive different critical densities that control the formation and coexistence of groups. Our novel approach sheds new light on the early stage of network growth and the emergence of large connected components.
Successfully integrating newcomers into native communities has become a key issue for policy makers, as the growing number of migrants has brought cultural diversity, new skills, and at times, societal tensions to receiving countries. We develop an a
gent-based network model to study interacting hosts and guests and identify the conditions under which cooperative/integrated or uncooperative/segregated societies arise. Players are assumed to seek socioeconomic prosperity through game theoretic rules that shift network links, and cultural acceptance through opinion dynamics. We find that the main predictor of integration under given initial conditions is the timescale associated with cultural adjustment relative to social link remodeling, for both guests and hosts. Fast cultural adjustment results in cooperation and the establishment of host-guest connections that are sustained over long times. Conversely, fast social link remodeling leads to the irreversible formation of isolated enclaves, as migrants and natives optimize their socioeconomic gains through in-group connections. We discuss how migrant population sizes and increasing socioeconomic rewards for host-guest interactions, through governmental incentives or by admitting migrants with highly desirable skills, may affect the overall immigrant experience.
Quantifying human group dynamics represents a unique challenge. Unlike animals and other biological systems, humans form groups in both real (offline) and virtual (online) spaces -- from potentially dangerous street gangs populated mostly by disaffec
ted male youths, through to the massive global guilds in online role-playing games for which membership currently exceeds tens of millions of people from all possible backgrounds, age-groups and genders. We have compiled and analyzed data for these two seemingly unrelated offline and online human activities, and have uncovered an unexpected quantitative link between them. Although their overall dynamics differ visibly, we find that a common team-based model can accurately reproduce the quantitative features of each simply by adjusting the average tolerance level and attribute range for each population. By contrast, we find no evidence to support a version of the model based on like-seeking-like (i.e. kinship or `homophily).
Community structure is an important property of complex networks. An automatic discovery of such structure is a fundamental task in many disciplines, including sociology, biology, engineering, and computer science. Recently, several community discove
ry algorithms have been proposed based on the optimization of a quantity called modularity (Q). However, the problem of modularity optimization is NP-hard, and the existing approaches often suffer from prohibitively long running time or poor quality. Furthermore, it has been recently pointed out that algorithms based on optimizing Q will have a resolution limit, i.e., communities below a certain scale may not be detected. In this research, we first propose an efficient heuristic algorithm, Qcut, which combines spectral graph partitioning and local search to optimize Q. Using both synthetic and real networks, we show that Qcut can find higher modularities and is more scalable than the existing algorithms. Furthermore, using Qcut as an essential component, we propose a recursive algorithm, HQcut, to solve the resolution limit problem. We show that HQcut can successfully detect communities at a much finer scale and with a higher accuracy than the existing algorithms. Finally, we apply Qcut and HQcut to study a protein-protein interaction network, and show that the combination of the two algorithms can reveal interesting biological results that may be otherwise undetectable.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
