Skip to main content
SpringerLink
Log in

Ranking Nodes Using Reputation

  • Chapter
  • First Online:
Algorithms and Dynamical Models for Communities and Reputation in Social Networks

Part of the book series: Springer Theses ((Springer Theses))

  • 857 Accesses

Abstract

In many online settings, such as in online markets or peer-to-peer applications, we want to preferably deal with trustworthy partners. Usually, by letting users rate each other, some indication of trustworthiness is obtained. However, the ratings of users that are themselves not trustworthy should not be trusted. We here suggest a method for solving this issue, which allows for a ranking of nodes based on their reputation. In particular, it allows also for negative links, where users explicitly indicate they do not trust somebody.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    This distribution is also known as the Gumbel distribution.

References

  1. Abrams, Z, McGrew, R and Plotkin, S (2004). Keeping Peers Honest in EigenTrust. In 2nd Workshop on the Economics of Peer-to-Peer Systems.

    Google Scholar 

  2. Altafini C (2012) Dynamics of opinion forming in structurally balanced social networks. PloS one 7(6):e38135. doi:10.1371/journal.pone.0038135

    Article  ADS  Google Scholar 

  3. Anderson SP, de de Palma, A and Thisse, JF, (1992) Discrete Choice Theory of Product Differentiation. The MIT Press, Cambridge

    Google Scholar 

  4. Bonacich, P (1987). Power and centrality: A family of measures. American journal of sociology.

    Google Scholar 

  5. Bonacich P (2007) Some unique properties of eigenvector centrality. Social Networks 29:555–564. doi:10.1016/j.socnet.2007.04.002

    Article  Google Scholar 

  6. Brin S, Page L (1998) The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30(1–7):107–117. doi:10.1016/S0169-7552(98)00110-X

    Article  Google Scholar 

  7. Christley RM, Pinchbeck GL, Bowers RG, Clancy D, French NP et al (2005) Infection in social networks: using network analysis to identify high-risk individuals. American journal of epidemiology 162(10):1024–31. doi:10.1093/aje/kwi308

    Article  Google Scholar 

  8. De P, Singh AE, Wong T, Yacoub W, Jolly AM (2004) Sexual network analysis of a gonorrhoea outbreak. Sexually transmitted infections 80(4):280–5. doi:10.1136/sti.2003.007187

    Article  Google Scholar 

  9. De Kerchove, C and Van Dooren, P (2008). The PageTrust algorithm: how to rank web pages when negative links are allowed. In Proceedings of the SIAM International Conference on Data Mining, pages 346–352. SIAM.

    Google Scholar 

  10. DeGroot MH (1974) Reaching a consensus. Journal of the American Statistical Association 69(345):118–121. doi:10.2307/2285509

    Article  MATH  Google Scholar 

  11. Freeman LC (1977) A Set of Measures of Centrality Based on Betweenness. Sociometry 40(1):35. doi:10.2307/3033543

    Article  Google Scholar 

  12. Freeman LC (1978) Centrality in social networks conceptual clarification. Social Networks 1(3):215–239. doi:10.1016/0378-8733(78)90021-7

    Article  MathSciNet  Google Scholar 

  13. Guha, R, Kumar, R, Raghavan, P and Tomkins, A (2004). Propagation of trust and distrust. In Proceedings of the 13th conference on World Wide Web - WWW ’04, page 403. ACM Press, New York, New York, USA. ISBN 158113844X. doi:10.1145/988672.988727

  14. Kamvar, SD, Schlosser, MT and Garcia-Molina, H (2003). The Eigentrust algorithm for reputation management in P2P networks. In Proceedings of the twelfth international conference on World Wide Web - WWW ’03, page 640. ACM Press, New York, New York, USA. ISBN 1581136803. doi:10.1145/775152.775242

  15. Kleinberg JM (1999) Authoritative Sources in a Hyperlinked Environment. Journal of the ACM 46(5):604–632. doi:10.1145/324133.324140

    Article  MATH  MathSciNet  Google Scholar 

  16. Maoz Z, Terris LG, Kuperman RD, Talmud I (2008) What Is the Enemy of My Enemy? Causes and Consequences of Imbalanced International Relations, 1816–2001. The Journal of Politics 69(01):100–115. doi:10.1111/j.1468-2508.2007.00497.x

    Google Scholar 

  17. Massa, P and Avesani, P (2005). Controversial Users demand Local Trust Metrics : an Experimental Study on Epinions. In Proceedings of the National Conference on Artificial Intelligence, pages 121–126.

    Google Scholar 

  18. Massa, P and Hayes, C (2005). Page-reRank: Using Trusted Links to Re-Rank Authority. In The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI’05), pages 614–617. IEEE. ISBN 0-7695-2415-X. doi:10.1109/WI.2005.112

  19. Newman, MEJ (2006). Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 74(3):036104+. doi:10.1103/PhysRevE.74.036104

  20. Olfati-Saber R, Fax JA, Murray RM (2007) Consensus and cooperation in networked multi-agent systems. Proceedings of the IEEE 95(1):215–233

    Article  Google Scholar 

  21. Perra N, Fortunato S (2008) Spectral centrality measures in complex networks. Physical Review E 78(3):036107. doi:10.1103/PhysRevE.78.036107

    Article  ADS  MathSciNet  Google Scholar 

  22. Resnick P, Zeckhauser R, Swanson J, Lockwood K (2006) The value of reputation on eBay: A controlled experiment. Experimental Economics 9(2):79–101. doi:10.1007/s10683-006-4309-2

  23. Shi, G, Proutiere, A, Johansson, M, Baras, JS and Johansson, KH (2013). The evolution of beliefs over signed social networks. [arXiv]1307.0539.

    Google Scholar 

  24. Szell M, Lambiotte R, Thurner S (2010) Multirelational organization of large-scale social networks in an online world. Proceedings of the National Academy of Sciences of the United States of America 107(31):13636–41. doi:10.1073/pnas.1004008107. [arXiv]1003.5137

  25. Watts DJ (2002) A simple model of global cascades on random networks. Management 99(9):

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. KITLV, Leiden, The Netherlands

    Vincent Traag

Authors
  1. Vincent Traag
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vincent Traag .

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Traag, V. (2014). Ranking Nodes Using Reputation. In: Algorithms and Dynamical Models for Communities and Reputation in Social Networks. Springer Theses. Springer, Cham. https://doi.org/10.1007/978-3-319-06391-1_10

Download citation

Publish with us

Policies and ethics

Search

Navigation