On Playing with Emotion: A Spatial Evolutionary Variation of the Ultimatum Game.

The Ultimatum Game is a simplistic representation of bargaining processes occurring in social networks. In the standard version of this game, the first player, called the proposer, makes an offer on how to split a certain amount of money. If the second player, called the responder, accepts the offer, the money is divided according to the proposal; if the responder declines the offer, both players receive no money. In this article, an agent-based model is employed to evaluate the performance of five distinct strategies of playing a modified version of this game. A strategy corresponds to instructions on how a player must act as the proposer and as the responder. Here, the strategies are inspired by the following basic emotions: anger, fear, joy, sadness, and surprise. Thus, in the game, each interacting agent is a player endowed with one of these five basic emotions. In the modified version explored in this article, the spatial dimension is taken into account and the survival of the players depends on successful negotiations. Numerical simulations are performed in order to determine which basic emotion dominates the population in terms of prevalence and accumulated money. Information entropy is also computed to assess the time evolution of population diversity and money distribution. From the obtained results, a conjecture on the emergence of the sense of fairness is formulated.

A network model of social contacts with small-world and scale-free features, tunable connectivity, and geographic restrictions.

Small-world networks and scale-free networks are well-known theoretical models within the realm of complex graphs. These models exhibit "low" average shortest-path length; however, key distinctions are observed in their degree distributions and average clustering coefficients: in small-world networks, the degree distribution is bell-shaped and the clustering is "high"; in scale-free networks, the degree distribution follows a power law and the clustering is "low". Here, a model for generating scale-free graphs with "high" clustering is numerically explored, since these features are concurrently identified in networks representing social interactions. In this model, the values of average degree and exponent of the power-law degree distribution are both adjustable, and spatial limitations in the creation of links are taken into account. Several topological metrics are calculated and compared for computer-generated graphs. Unexpectedly, the numerical experiments show that, by varying the model parameters, a transition from a power-law to a bell-shaped degree distribution can occur. Also, in these graphs, the degree distribution is most accurately characterized by a pure power-law for values of the exponent typically found in real-world networks.