Learning agent influence in MAS with complex social networks
نویسندگان
چکیده
منابع مشابه
Learning influence in complex social networks
In open Multi-Agent Systems, where there is no centralised control and individuals have equal authority, ensuring cooperative and coordinated behaviour is challenging. Norms and conventions are a useful means of supporting cooperation in an emergent decentralised manner, however it takes time for effective norms and conventions to emerge. Identifying influential individuals enables the targeted...
متن کاملAgent-based Influence Maintenance in Social Networks
We study on how to maintain long-term influence in a social network by proposing an agent-based influence maintenance model. Within the context of our investigation, the experimental results reveal that multiple-time seed selection is capable of achieving more constant impact than one-shot selection.
متن کاملDetecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملSimple Heuristics in Complex Networks: Models of Social Influence
The concept of heuristic decision making is adapted to dynamic influence processes in social networks. We report results of a set of simulations, in which we systematically varied: a) the agents' strategies for contacting fellow group members and integrating collected information, and (b) features of their social environment — the distribution of members' status, and the degree of clustering in...
متن کاملInfluence Maximization in Social Networks using Learning Automata
Influence maximization problem is one of the challenges in online social networks. This problem refers to finding a small set of members of a social network, by activation of whichinformation propagation can be maximized using one of the propagation models such as independent cascade model. For the maximization problem, the greedy algorithm has beenpresented which isclose to optimal response by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Autonomous Agents and Multi-Agent Systems
سال: 2013
ISSN: 1387-2532,1573-7454
DOI: 10.1007/s10458-013-9241-1