Abstract
Recently, service differentiation based incentive mechanisms are proposed in dynamic networking environments like Peer-to-Peer (P2P), wireless Ad hoc networks, etc.: define small meaningful classes of services and assign participants to these classes according to their overall resource contribution. Basically, there exist two fundamental components: How to define different classes? And who can assign autonomous participants to these classes? We argue that those environments are intrinsically anonymous, dynamic and autonomous, which has the following implications: Users can change their identities with near zero cost (cheap pseudonyms); most interactions in autonomous networks should be one-time (that is, each peer has no idea about other peers’ behavior history, except their current behaviors); and all behaviors and actions are all endogenous, voluntarily chosen and determined by independent and rational peers. Specifically, in the simplest case, service differentiation based incentive mechanisms could be provided with two ways: punish defect behavior (punishment-based scheme), or reward cooperative behavior (reward-based scheme). This paper preliminarily investigated the effectiveness of punishment-based and reward-based incentive mechanisms in anonymous, dynamic and autonomous environments. Our contributions are following: first, under the above networking environment, we found that the traditional service differentiation based incentive schemes could not work, irrespective of punishment-based and reward-based schemes; then, if peers can voluntarily join the system, and small entry fee is set for participation, we got that the performance of punishment-based scheme (first providing high-level service plus punishment) is always better than that of reward-based scheme (first providing low-level service plus reward).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adar, E., Huberman, B.: Free Riding on Gnutella. First Monday Online Journal (2000)
Hughes, D., Coulson, G., Walkerdine, J.: Free Riding on Gnutella Revisited: the Bell Tolls? IEEE Distributed Systems Online 6 (2005)
Antoniadis, P., Friedman, T., Cuvellier, X.: Resource Provision and Allocation in Shared Network Testbed Infrastructures. In: The Workshop on Real Overlays and Distributed Systems (2007)
Feldman, M., Lai, K., Zhang, L.: A Price-Anticipating Resource Allocation Mechanism for Distributed Shared Clusters. In: ACM Conference on Electronic Commerce (2005)
Courcoubetis, C., Weber, R.: Incentives for Large Peer-to-Peer Systems. IEEE Journal on Selected Areas in Communications 24(5) (2006)
Feldman, M., Papadimitriou, C., Chuang, J., Stoica, I.: Free-Riding and Whitewashing in Peer-to-Peer Systems. IEEE Journal on Selected Areas in Communications 24(5) (2006)
Wang, Y., Nakao, A., Ma, J.H.: A Simple Public-Goods Game Based Incentive Mechanism for Resource Provision in P2P Networks. In: Yu, Z., Liscano, R., Chen, G., Zhang, D., Zhou, X. (eds.) UIC 2010. LNCS, vol. 6406, pp. 352–365. Springer, Heidelberg (2010)
Zhao, Q., Lui, C.S., Chiu, D.M.: Mathematical Modeling of Incentive Policies in P2P Systems. In: ACM Workshop on Network Economics (2008)
Zhao, Q., Lui, C.S., Chiu, D.M.: Analysis of Adaptive Incentive Protocols for P2P Networks. In: INFOCOM (2009)
Wang, Y.F., Nakao, A., Vasilakos, A.V., Ma, J.H.: P2P Soft Security: On Evolutionary Dynamics of P2P Incentive Mechanism. Computer Communications 34(3) (2011)
Hauert, C., et al.: Exploration Dynamics in Evolutionary Games. Proceedings of the National Academy of Sciences 106(3) (2009)
Hauert, C., et al.: Via Freedom to Coercion: the Emergence of Costly Punishment. Science 316(5833), 905–1907 (2007)
Rand, D.G., Dreber, A., Ellingsen, T., Fudenberg, D., Nowak, M.A.: Positive Interactions Promote Public Cooperation. Science (325) (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Y., Vasilakos, A.V., Ma, J. (2011). Punishment or Reward: It Is a Problem in Anonymous, Dynamic and Autonomous Networking Environments. In: Hsu, CH., Yang, L.T., Ma, J., Zhu, C. (eds) Ubiquitous Intelligence and Computing. UIC 2011. Lecture Notes in Computer Science, vol 6905. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23641-9_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-23641-9_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23640-2
Online ISBN: 978-3-642-23641-9
eBook Packages: Computer ScienceComputer Science (R0)