A Novel Approach to Propagating Distrust

  • Christian Borgs
  • Jennifer Chayes
  • Adam Tauman Kalai
  • Azarakhsh Malekian
  • Moshe Tennenholtz
Conference paper

DOI: 10.1007/978-3-642-17572-5_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6484)
Cite this paper as:
Borgs C., Chayes J., Kalai A.T., Malekian A., Tennenholtz M. (2010) A Novel Approach to Propagating Distrust. In: Saberi A. (eds) Internet and Network Economics. WINE 2010. Lecture Notes in Computer Science, vol 6484. Springer, Berlin, Heidelberg

Abstract

Trust propagation is a fundamental topic of study in the theory and practice of ranking and recommendation systems on networks. The Page Rank [9] algorithm ranks web pages by propagating trust throughout a network, and similar algorithms have been designed for recommendation systems. How might one analogously propagate distrust as well? This is a question of practical importance and mathematical intrigue (see, e.g., [2]). However, it has proven challenging to model distrust propagation in a manner which is both logically consistent and psychologically plausible. We propose a novel and simple extension of the Page Rank equations, and argue that it naturally captures most types of distrust that are expressed in such networks. We give an efficient algorithm for implementing the system and prove desirable properties of the system.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Christian Borgs
    • 1
  • Jennifer Chayes
    • 1
  • Adam Tauman Kalai
    • 1
  • Azarakhsh Malekian
    • 2
  • Moshe Tennenholtz
    • 3
  1. 1.Microsoft ResearchNew England
  2. 2.EECS DepartmentNorthwestern University 
  3. 3.Microsoft R and D centerIsrael

Personalised recommendations