Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
Cooperation without memory or space: tags, groups and the prisoner's dilemma
MABS 2000 Proceedings of the second international workshop on Multi-agent based simulation
Linked
Evolving social rationality for MAS using "tags"
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
SLIC: A Selfish Link-Based Incentive Mechanism for Unstructured Peer-to-Peer Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Evolving specialisation, altruism, and group-level optimisation using tags
MABS'02 Proceedings of the 3rd international conference on Multi-agent-based simulation II
Change your tags fast! - a necessary condition for cooperation?
MABS'04 Proceedings of the 2004 international conference on Multi-Agent and Multi-Agent-Based Simulation
Evolving networks for social optima in the "weakest link game"
Computational & Mathematical Organization Theory
Mechanisms for the self-organization of peer groups in agent societies
MABS'10 Proceedings of the 11th international conference on Multi-agent-based simulation
Choose your tribe! – evolution at the next level in a peer-to-peer network
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
Gossip-Based self-organising open agent societies
PRIMA'10 Proceedings of the 13th international conference on Principles and Practice of Multi-Agent Systems
Gossip-Based Self-Organising Agent Societies and the Impact of False Gossip
Minds and Machines
| Hi-index | 0.00 |
For Peer-2-Peer (P2P) networks to realize their full potential the nodes they are composed of need to coordinate and cooperate, to improve the performance of the network as a whole. This requires the suppression of selfish behavior (free-riding). Existing P2P systems often assume that nodes will behave altruistically, but this has been shown to be far from the case. We outline encouraging initial results from a P2P simulation that translates and applies the properties of “tag” models (initially developed within social simulations) [8, 9] to tackle these issues. We find that a simple node rewiring policy, based on the tag dynamics, quickly eliminates free-riding without centralized control. The process appears highly scalable and robust.