2011
DOI: 10.1145/1978542.1978560
|View full text |Cite
|
Sign up to set email alerts
|

Reputation systems for open collaboration

Abstract: Algorithmic-based user incentives ensure the trustworthiness of evaluations of Wikipedia entries and Google Maps business information.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
39
0
4

Year Published

2012
2012
2017
2017

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 75 publications
(43 citation statements)
references
References 13 publications
0
39
0
4
Order By: Relevance
“…10 Reputation scores are mainly built on community members' feedback about workers' activities in the system. 11 Sometimes, this feedback is explicit -that is, community members explicitly cast feedback on a worker's quality or contributions by, for instance, rating or ranking the content the worker has created. In other cases, feedback is cast implicitly, as in Wikipedia, when subsequent editors preserve the changes a particular worker has made.…”
Section: Worker Profilesmentioning
confidence: 99%
“…10 Reputation scores are mainly built on community members' feedback about workers' activities in the system. 11 Sometimes, this feedback is explicit -that is, community members explicitly cast feedback on a worker's quality or contributions by, for instance, rating or ranking the content the worker has created. In other cases, feedback is cast implicitly, as in Wikipedia, when subsequent editors preserve the changes a particular worker has made.…”
Section: Worker Profilesmentioning
confidence: 99%
“…WikiTrust was also focused to identify vandalized encyclopedic articles. Here the acts of vandalism are identified by the activity of anonyms (users acting without registration) and new users, who are just registered [16,17].…”
Section: Related Workmentioning
confidence: 99%
“…In decentralized systems, like BarterCast, where each node stores and analyzes data locally using, e.g., the max-flow algorithm (with complexity O(nm 2 ) where n is the number of nodes and m and the number of edges), even much smaller graphs of 10 6 nodes make the computation of reputations prohibitive. Taking into account that the contributions of nodes in the computation of reputations are not equal in quality and quantity [8], thus we aim to delete the least important contributions and compute reputations using only a subset of the complete history. In this way, we can reduce the computational cost significantly without decreasing the accuracy very much.…”
Section: Motivation and Problem Statementmentioning
confidence: 99%
“…A family of reputation systems useful in many Internet applications consists of interaction-based systems (also called content-driven systems [8]). These systems are based on algorithms analyzing all interactions among users and computing the reputations without using any explicit feedback from users, such as PageRank [18] for ranking web pages and Bartercast [17] for computing reputations of users in P2P systems.…”
Section: Introductionmentioning
confidence: 99%