Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Incentives for sharing in peer-to-peer networks
Proceedings of the 3rd ACM conference on Electronic Commerce
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
Proofs of Work and Bread Pudding Protocols
CMS '99 Proceedings of the IFIP TC6/TC11 Joint Working Conference on Secure Information Networks: Communications and Multimedia Security
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
A Game Theoretic Framework for Incentives in P2P Systems
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Robust incentive techniques for peer-to-peer networks
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
ICDEW '06 Proceedings of the 22nd International Conference on Data Engineering Workshops
Indirect partner interaction in peer-to-peer networks: stimulating cooperation by means of structure
Proceedings of the 8th ACM conference on Electronic commerce
Experimental economics and experimental computer science: a survey
Proceedings of the 2007 workshop on Experimental computer science
Experimental economics and experimental computer science: a survey
ecs'07 Experimental computer science on Experimental computer science
Do humans identify efficient strategies in structured peer-to-peer systems?
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Competition vs. Fairness - Analyzing Structured Networks by Means of User Experiments
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Incentivizing connectivity in structured Peer-to-Peer systems
Web Intelligence and Agent Systems
Cooperating with free riders in unstructured P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Structured peer-to-peer systems allow to administer large volumes of data. Several peers collaborate to generate a query result. Analyses of unstructured peer-to-peer systems, namely of those for file-sharing, show that peers tend to shirk collaboration. We anticipate similar behavior in structured peer-to-peer systems. Recently, protocols to counter uncooperative behavior in such systems have been proposed. This article examines the behavior of peers under such protocols, using game theory. A first result of this paper is a set of hypotheses, e.g.: Peers answer queries if more than a certain percentage of their queries is answered. In many situations, free-riding does not lead to a break-down of the system. Trust, reciprocity and reputation building via a feedback mechanism are behavioral motives that increase cooperation. As a second step, we have conducted economic experiments with human participants to validate our predictions. Such experiments are important because we do not need to make any assumptions regarding the behavior of peers. It turns out that the predictions remain valid in these experiments.