A survey on distributed approaches to graph based reputation measures

  • Authors:
  • Konstantin Avrachenkov;Danil Nemirovsky;Kim Son Pham

  • Affiliations:
  • INRIA Sophia Antipolis, Route des Lucioles, France;St. Petersburg State University, Russia;St. Petersburg State University, Russia

  • Venue:
  • Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Reputation systems are indispensable for the operation of Internet mediated services, electronic markets, document ranking systems, P2P networks and Ad Hoc networks. Here we survey available distributed approaches to the graph based reputation measures. Graph based reputation measures can be viewed as random walks on directed weighted graphs whose edges represent interactions among peers. We classify the distributed approaches to graph based reputation measures into three categories. The first category is based on asynchronous methods. The second category is based on the aggregation/decomposition methods. And the third category is based on the personalization methods which use the information available locally.