Rating propagation in web services reputation systems: A fast shapley value approach

An Liu, Qing Li, Xiaofang Zhou, Lu Li, Guanfeng Liu, Yunjun Gao

Research output: Journal article publicationConference articleAcademic researchpeer-review

8 Citations (Scopus)


A new challenge in Web services reputation systems is to update the reputation of component services. As an emerging solution, rating propagation has received much attention recently. Current rating propagation algorithms either fail to fairly distribute the overall rating to component services or can realize a fair rating distribution at the cost of exponential time complexity. In this paper, we propose a fast Shapley value approach to propagate the overall rating of a composite service to its component services. Our approach ensures the fairness of rating propagation by using the advantage of the Shapley value, but significantly decreases its computational complexity from exponential to quadratic. Its fairness and efficiency are validated by experiments.

Original languageEnglish
Pages (from-to)466-480
Number of pages15
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8421 LNCS
Issue numberPART 1
Publication statusPublished - 1 Jan 2014
Externally publishedYes
Event19th International Conference on Database Systems for Advanced Applications, DASFAA 2014 - Bali, Indonesia
Duration: 21 Apr 201424 Apr 2014


  • reputation propagation
  • service composition
  • Shapley value

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Rating propagation in web services reputation systems: A fast shapley value approach'. Together they form a unique fingerprint.

Cite this