Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Finding nearest neighbors in growth-restricted metrics
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Equilibria in topology control games for ad hoc networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
LAND: stretch (1 + ε) locality-aware networks for DHTs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The Price of Stability for Network Design with Fair Cost Allocation
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Computing correlated equilibria in multi-player games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On hierarchical routing in doubling metrics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The price of selfish behavior in bilateral network formation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Meridian: a lightweight network location service without virtual coordinates
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Influences on cooperation in BitTorrent communities
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Incentives in BitTorrent induce free riding
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
On nash equilibria for a network creation game
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Practical locality-awareness for large scale information sharing
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
An empirical study of free-riding behavior in the maze p2p file-sharing system
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
When selfish meets evil: byzantine players in a virus inoculation game
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
On cost sharing mechanisms in the network design game
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
A network formation game for bipartite exchange economies
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Designing networks with good equilibria
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Cost sharing mechanisms for near-optimal traffic aggregation and network design
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
On the windfall of friendship: inoculation strategies on social networks
Proceedings of the 9th ACM conference on Electronic commerce
Bounded budget connection (BBC) games or how to make friends and influence people, on a budget
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
An exercise in selfish stabilization
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Network Creation Games with Disconnected Equilibria
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
Robust live media streaming in swarms
Proceedings of the 18th international workshop on Network and operating systems support for digital audio and video
EGOIST: overlay routing using selfish neighbor selection
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
A recall-based cluster formation game in peer-to-peer systems
Proceedings of the VLDB Endowment
Equilibrium selection in multistage congestion games for real-time streaming
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
A round-based pricing scheme for maximizing service provider's revenue in P2PTV networks
IMSAA'09 Proceedings of the 3rd IEEE international conference on Internet multimedia services architecture and applications
On cooperative and efficient overlay network evolution based on a group selection pattern
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
On cooperative and efficient overlay network evolution based on a group selection pattern
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on game theory
Brief announcement: the price of anarchy for distributed network formation in an adversary model
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Constructing traffic-aware overlay topologies: a machine learning approach
IPTPS'08 Proceedings of the 7th international conference on Peer-to-peer systems
Designing Network Protocols for Good Equilibria
SIAM Journal on Computing
Fast track article: Peer-to-peer overlay topology control for mobile ad hoc networks
Pervasive and Mobile Computing
N-party BAR Transfer: motivation, definition, and challenges
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Bounded budget betweenness centrality game for strategic network formations
Theoretical Computer Science
Defending against distance cheating in link-weighted application-layer multicast
IEEE/ACM Transactions on Networking (TON)
The emergence of sparse spanners and greedy well-separated pair decomposition
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Tiara: A self-stabilizing deterministic skip list and skip graph
Theoretical Computer Science
Towards network games with social preferences
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Asynchrony and collusion in the n-party BAR transfer problem
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Behavior-based reputation management in P2P file-sharing networks
Journal of Computer and System Sciences
On dynamics in selfish network creation
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
On the Windfall and price of friendship: Inoculation strategies on social networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Current peer-to-peer (P2P) systems often suffer from a large fraction of freeriders not contributing any resources to the network. Various mechanisms have been designed to overcome this problem. However, the selfish behavior of peers has aspects which go beyond resource sharing. This paper studies the effects on the topology of a P2P network if peers selfishly select the peers to connect to. In our model, a peer exploits locality properties in order to minimize the latency (or response times) of its lookup operations. At the same time, the peer aims at not having to maintain links to too many other peers in the system. By giving tight bounds on the price of anarchy, we show that the resulting topologies can be much worse than if peers collaborated. Moreover, the network may never stabilize, even in the absence of churn. Finally, we establish the complexity of Nash equilibria in our game theoretic model of P2P networks. Specifically, we prove that it is NP-hard to decide whether our game has a Nash equilibrium and can stabilize.