Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Incentives for sharing in peer-to-peer networks
Proceedings of the 3rd ACM conference on Electronic Commerce
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Dynamic Programming and Optimal Control
Dynamic Programming and Optimal Control
Introduction to Reinforcement Learning
Introduction to Reinforcement Learning
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
PPay: micropayments for peer-to-peer systems
Proceedings of the 10th ACM conference on Computer and communications security
An Incentive Mechanism for P2P Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
SLIC: A Selfish Link-Based Incentive Mechanism for Unstructured Peer-to-Peer Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Incentives to Promote Availability in Peer-to-Peer Anonymity Systems
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
FRAME: an innovative incentive scheme in vehicular networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Incentive strategy based on trust model in P2P network
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 3
Threshold behavior of incentives in social networks
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
Hi-index | 0.00 |
Distributed message relaying is an important function of a peer-to-peer system to discover service providers. Existing search protocols in unstructured peer-to-peer systems either create huge burden on communications or cause long response time. Moreover, these systems are also vulnerable to the free riding problem. In this paper we present an incentive mechanism that not only mitigates the free riding problem, but also achieves good system efficiency in message relaying for peer discovery. In this mechanism promised rewards are passed along the message propagation process. A peer is rewarded if a service provider is found via a relaying path that includes this peer. We provide some analytic insights to the symmetric Nash equilibrium strategies of this game, and an approximate approach to calculate this equilibrium. Experiments show that this incentive mechanism brings a system utility generally higher than breadth-first search and random walks, based on both the estimated utility from our approximate equilibrium and the utility generated from learning in the incentive mechanism.