Elucidating strategic network dynamics through computational modeling
Computational & Mathematical Organization Theory
An Immunity Inspired Real-Time Cooperative Control Framework for Networked Multi-agent Systems
ICARIS '09 Proceedings of the 8th International Conference on Artificial Immune Systems
A tag-mediated N-person Prisoner's Dilemma game on networks with different topologies
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Cooperation through self-similar social networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
The coevolution of loyalty and cooperation
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Modifying trust dynamics through cooperation and defection in evolving social networks
TRUST'11 Proceedings of the 4th international conference on Trust and trustworthy computing
Sustaining cooperation on networks: an analytical study based on evolutionary game theory
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Structural Search and Optimization in Social Networks
INFORMS Journal on Computing
The asymmetric diffusion of trust between communities: simulations in dynamic social networks
Proceedings of the Winter Simulation Conference
International Journal of Knowledge and Systems Science
Compensatory seeding in networks with varying avaliability of nodes
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Rating Protocols in Online Communities
ACM Transactions on Economics and Computation
Hi-index | 0.02 |
We study the problem of cooperative behavior emerging in an environment where individual behaviors and interaction structures coevolve. Players not only learn which strategy to adopt by imitating the strategy of the best-performing player they observe, but also choose with whom they should interact by selectively creating and/or severing ties with other players based on a myopic cost-benefit comparison. We find that scalable cooperation---that is, high levels of cooperation in large populations---can be achieved in sparse networks, assuming that individuals are able to sever ties unilaterally and that new ties can only be created with the mutual consent of both parties. Detailed examination shows that there is an important trade-off between local reinforcement and global expansion in achieving cooperation in dynamic networks. As a result, networks in which ties are costly and local structure is largely absent tend to generate higher levels of cooperation than those in which ties are made easily and friends of friends interact with high probability, where the latter result contrasts strongly with the usual intuition.