Topological implications of selfish neighbor selection in unstructured peer-to-peer networks

DOI10.1007/s00453-010-9398-9zbMath1221.68038OpenAlexW2108934667MaRDI QIDQ639277

Stefan Schmid, Roger Wattenhofer, Thomas Moscibroda

Publication date: 20 September 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-010-9398-9

zbMATH Keywords

game theorymetric spacesNP-hardnessprice of anarchypeer-to-peer

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Applications of game theory (91A80) Distributed systems (68M14)

Related Items

Stability, efficiency, and contentedness of social storage networks, Resource availability in the social cloud: An economics perspective, Formation of stable and efficient social storage cloud, Geometric spanner games

Uses Software

• Pastry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simplified NP-complete satisfiability problem
• Accessing nearby copies of replicated objects in a distributed environment
• How much can taxes help selfish routing?
• On a network creation game
• The Evolution of Cooperation
• How bad is selfish routing?
• The Price of Stability for Network Design with Fair Cost Allocation
• Finding nearest neighbors in growth-restricted metrics
• On nash equilibria for a network creation game
• Off-Line Karma: A Decentralized Currency for Peer-to-peer and Grid Applications
• A New Mechanism for the Free-Rider Problem
• Algorithms, games, and the internet
• The price of selfish behavior in bilateral network formation
• On the topologies formed by selfish peers
• The Price of Anarchy in Cooperative Network Creation Games
• The price of anarchy in network creation games
• The complexity of theorem-proving procedures