Selfish versus unselfish optimization of network creation

DOI10.1088/1742-5468/2005/08/P08007MaRDI QIDQ4968870zbMATH OpenFDO

Authors Johannes Schneider, Scott Kirkpatrick

Publication date 9 July 2019

Published in Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

zbMATH Keywords

networksrandom graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43)

Recommendations

• On a network creation game
• Selfish network creation with non-uniform edge cost
• On selfish creation of robust networks
• Network creation games: think global -- act local

Cites work

• Emergence of Scaling in Random Networks
• Equilibrium points in n -person games
• On a network creation game
• The complexity of pure Nash equilibria
• Worst-case equilibria

Cited in

(6)

• Near-optimal network design with selfish agents
• Evaluating the impact of selfish behaviors on epidemic forwarding in mobile social networks
• STRUCTURAL PROPERTIES OF CORE–PERIPHERY COMMUNITIES
• Topological implications of selfish neighbor selection in unstructured peer-to-peer networks
• On selfish creation of robust networks
• Selfish network creation with non-uniform edge cost

This page was built for publication: Selfish versus unselfish optimization of network creation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4968870)