Affiliations: [a] Department of Systems and Computer Engineering, Carleton University, 1125 Colonel by Drive, Ottawa, Ontario, K1S 5B6, Canada | [b] Department of Computer Science, Faculty of Mathematics and Computer Science, University of Science and Technology of Oran Mohamed Boudiaf, Oran, Algeria
Abstract: This paper presents a simple model for representing and evaluating the behavior of users participating in a decentralized data-sharing system. The aim is to explore alternatives to current Web 2.0 systems which suffer from trust attacks, bias, administrative overhead and brittleness. In our model, users get to share documents that they like and they follow other users who are more likely to share documents that they will like. Since there is no central authority, the users also use local and independent means of discovering and ranking documents. We show, using a simulation of the model, that this scheme provides an incentive for users to contribute to the system, and it makes the system more resistant to attacks.
Keywords: Decentralized web, Social Machines, peer-to-peer networks, computational trust, incentives