On the topologies formed by selfish peers

DOI10.1145/1146381.1146403zbMath1314.68162OpenAlexW2157232743MaRDI QIDQ5177274

Thomas Moscibroda, Roger Wattenhofer, Stefan Schmid

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2006/643/

zbMATH Keywords

game theoryNP-hardnessnetwork creation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Network design and communication in computer systems (68M10) (n)-person games, (n>2) (91A06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12)

Related Items (11)

Stability, efficiency, and contentedness of social storage networks ⋮ Geometric Network Creation Games ⋮ Tiara: a self-stabilizing deterministic skip list and skip graph ⋮ The Impact of Cooperation in Bilateral Network Creation ⋮ Topological implications of selfish neighbor selection in unstructured peer-to-peer networks ⋮ Bounded budget betweenness centrality game for strategic network formations ⋮ Network movement games ⋮ Behavior-based reputation management in P2P file-sharing networks ⋮ A note on the parallel runtime of self-stabilizing graph linearization ⋮ Network design with weighted players ⋮ Bounded budget connection (BBC) games or how to make friends and influence people, on a budget

This page was built for publication: On the topologies formed by selfish peers