Evolving networks for social optima in the “weakest link game”

@article{Rossi2009EvolvingNF,
  title={Evolving networks for social optima in the “weakest link game”},
  author={Giovanni Rossi and Stefano Arteconi and David Hales},
  journal={Computational and Mathematical Organization Theory},
  year={2009},
  volume={15},
  pages={95-108}
}
Previous models have applied evolving networks based on node-level “copy and rewire” rules to simple two player games (e.g. the Prisoner’s Dilemma). It was found that such models tended to evolve toward socially optimal behavior. Here we apply a similar technique to a more tricky co-ordination game (the weakest link game) requiring interactions from several players (nodes) that may play several strategies. We define a variant of the game with several equilibria—each offering increasing social… 
Emergent Social Rationality in a Peer-to-Peer System
TLDR
It was found that for both model variants altruistic behavior was selected when certain cost/benefit constraints were met, and Interestingly, the SkillWorld model evidences a kind of superaltruism in which nodes are prepared to cooperate even when the cost is higher than the benefit.
The observation of tolerance in a social network model
TLDR
This research investigates and defines the phenomenon of tolerance in dynamic social networks, particularly with the Highest Weighted Reward rule and defines a mathematical model to predict an agent's tolerance of a bad neighbor and determine the factors that affect it.
Simulating Tolerance in Dynamic Social Networks
TLDR
The paper defines a mathematical model to predict an agent's tolerance of a bad neighbor and determine the factors that affect it, providing situations in which tolerance can be used as a tool to affect network efficiency and network structure.
Preface to special issue on cooperation in selfish systems
TLDR
There has been an explosion of work utilising agent-based computer simulation to explore novel mechanisms for cooperation, and refinements have addressed systems with slightly less strong assumptions.
Evolutionary and socially inspired algorithms , tools and applications in dynamic nets
TLDR
This workpackage explores the fundamental problem of coordination in networks, particularly when agents or nodes within the network behave in a selfish way, that is, considering their own benefits rather than system level benefits, and shows how an evolutionary approach can find socially optimal equilibria in a group co-orindation game on a network.
FirmNet: the scope of firms and the allocation of task in a knowledge-based economy
TLDR
This work uses a computer simulation approach to investigate how local interaction of agents, endowed with skills and individual decision-making rules, may produce aggregate network structure able to perform tasks and found that self-organization depends on imitation of successful peers, competition among agents holding specific skills, and the structural features of organizational networks.
QLectives – Socially Intelligent Systems for Quality Project no. 231200 Instrument: Large-scale integrating project (IP) Programme: FP7-ICT Deliverable D2.1.1 Candidate theory models for cooperation algorithms
Dissemination level PU Public X PP Restricted to other programme participants (including the Commission Services) RE Restricted to a group specified by the consortium (including the Commission

References

SHOWING 1-10 OF 42 REFERENCES
Greedy Cheating Liars and the Fools Who Believe Them
TLDR
It is observed that in the first case, a certain percentage of such "greedy cheating liars" can actually improve certain performance measures, and in the second case, the network can maintain reasonable levels of cooperation even in the presence of a limited number of nihilist nodes.
Self-Organising, Open and Cooperative P2P Societies - From Tags to Networks
  • David Hales
  • Computer Science
    Engineering Self-Organising Systems
  • 2004
TLDR
It is found that a simple node rewiring policy, based on the tag dynamics, quickly eliminates free-riding without centralized control and the process appears highly scalable and robust.
Evolution of cooperation without reciprocity
TLDR
Computer simulations are used to show that cooperation can arise when agents donate to others who are sufficiently similar to themselves in some arbitrary characteristic, or ‘tag’, which can be a marking, display, or other observable trait.
Cooperation and bounded recall
Applying a socially inspired technique (tags) to improve cooperation in P2P networks
  • David Hales, B. Edmonds
  • Computer Science
    IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
  • 2005
TLDR
A simple algorithm is proposed that maintains high levels of cooperation in peer-to-peer networks of selfish adaptive peers while performing the collective task of file sharing and is demonstrated to be scalable, robust, and decentralized.
Choose Your Tribe! - Evolution at the Next Level in a Peer-to-Peer Network
  • David Hales
  • Computer Science
    Engineering Self-Organising Systems
  • 2005
TLDR
Simulation experiments with a simple selfish re-wiring protocol (SLAC) that can spontaneously self-organise networks into internally specialized groups (or “tribes”) are described, which are scalable, robust and self- Organising.
Cooperation without Memory or Space: Tags, Groups and the Prisoner's Dilemma
TLDR
A simpler approach in which players - which are either pure cooperators or defectors - can sustain cooperation with strangers by biasing game interactions towards others with the same tags (arbitrary bit strings representing "cultural markers").
Towards automatic social bootstrapping of peer-to-peer protocols
TLDR
A meta-protocol is proposed that intelligently selects and replicates those protocols that are for the social good --- that is, maximize the average utility of the entire population.
Strategic Uncertainty, Equilibrium Selection, and Coordination Failure in Average Opinion Games
Deductive equilibrium analysis often fails to provide a unique equilibrium solution in many situations of strategic interdependence. Consequently, a theory of equilibrium selection would be a useful
...
...