95,116 research outputs found
What constitutes a convention? Implications for the coexistence of conventions
A model of repeated play of a coordination game, where stage games have a location in social space, and players receive noisy signals of the true location of their games, is reviewed. Sugden (1995) suggests that in such a model, there can be a stationary state of convention coexistence only if interaction is non-uniform across social space. This paper shows that an alternative definition of conventions, which links conventions to actions rather than expectations, permits convention coexistence when interaction is uniform. To assess robustness, the concept of a global mutant is introduced, to which certain states of coexistence are robust.Conventions Coordination game Equilibrium selection JEL classification: C73
Who's who in networks. Wanted: the key group
Ballester, Calv ́o-Armengol, and Zenou (2006, Econometrica, 74/5, pp.
1403-17) show that in a network game with local payoff
complementarities, together with global uniform payoff substitutability
and own concavity effects, the intercentrality measure identifies the
key player - a player who, once removed, leads to the optimal change in
overall activity. In this paper we search for the key group in such
network games, whose members are, in general, different from the players
with the highest individual intercentralities. Thus the quest for a
single target is generalized to a group selection problem targeting an
arbitrary number of players, where the key group is identified by a
group intercentrality measure. We show that the members of a key group
are rather nonredundant actors, i.e., they are largely heterogenous in
their patterns of ties to the third parties
Leaders should not be conformists in evolutionary social dilemmas
The most common assumption in evolutionary game theory is that players should
adopt a strategy that warrants the highest payoff. However, recent studies
indicate that the spatial selection for cooperation is enhanced if an
appropriate fraction of the population chooses the most common rather than the
most profitable strategy within the interaction range. Such conformity might be
due to herding instincts or crowd behavior in humans and social animals. In a
heterogeneous population where individuals differ in their degree, collective
influence, or other traits, an unanswered question remains who should conform.
Selecting conformists randomly is the simplest choice, but it is neither a
realistic nor the optimal one. We show that, regardless of the source of
heterogeneity and game parametrization, socially the most favorable outcomes
emerge if the masses conform. On the other hand, forcing leaders to conform
significantly hinders the constructive interplay between heterogeneity and
coordination, leading to evolutionary outcomes that are worse still than if
conformists were chosen randomly. We conclude that leaders must be able to
create a following for network reciprocity to be optimally augmented by
conformity. In the opposite case, when leaders are castrated and made to
follow, the failure of coordination impairs the evolution of cooperation.Comment: 7 two-column pages, 4 figures; accepted for publication in Scientific
Reports [related work available at arXiv:1412.4113
Implications of Selfish Neighbor Selection in Overlay Networks
In a typical overlay network for routing or content sharing, each node must select a fixed number of immediate overlay neighbors for routing traffic or content queries. A selfish node entering such a network would select neighbors so as to minimize the weighted sum of expected access costs to all its destinations. Previous work on selfish neighbor selection has built intuition with simple models where edges are undirected, access costs are modeled by hop-counts, and nodes have potentially unbounded degrees. However, in practice, important constraints not captured by these models lead to richer games with substantively and fundamentally different outcomes. Our work models neighbor selection as a game involving directed links, constraints on the number of allowed neighbors, and costs reflecting both network latency and node preference. We express a node's "best response" wiring strategy as a k-median problem on asymmetric distance, and use this formulation to obtain pure Nash equilibria. We experimentally examine the properties of such stable wirings on synthetic topologies, as well as on real topologies and maps constructed from PlanetLab and AS-level Internet measurements. Our results indicate that selfish nodes can reap substantial performance benefits when connecting to overlay networks composed of non-selfish nodes. On the other hand, in overlays that are dominated by selfish nodes, the resulting stable wirings are optimized to such great extent that even non-selfish newcomers can extract near-optimal performance through naive wiring strategies.Marie Curie Outgoing International Fellowship of the EU (MOIF-CT-2005-007230); National Science Foundation (CNS Cybertrust 0524477, CNS NeTS 0520166, CNS ITR 0205294, EIA RI 020206
- …