Pattern analysis in social networks with dynamic connections

  • Authors:
  • Yu Wu;Yu Zhang

  • Affiliations:
  • Department of Computer Science, Standford University;Department of Computer Science, Trinity University

  • Venue:
  • SBP'11 Proceedings of the 4th international conference on Social computing, behavioral-cultural modeling and prediction
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we explore how decentralized local interactions of autonomous agents in a network relate to collective behaviors. Most existing work in this area models social network in which agent relations are fixed; instead, we focus on dynamic social networks where agents can rationally adjust their neighborhoods based on their individual interests. We propose a new connection evaluation rule called the Highest Weighted Reward (HWR) rule, with which agents dynamically choose their neighbors in order to maximize their own utilities based on the rewards from previous interactions. Our experiments show that in the 2-action pure coordination game, our system will stabilize to a clustering state where all relationships in the network are rewarded with the optimal payoff. Our experiments also reveal additional interesting patterns in the network.