Skip to main content

Abstract

The robustness of reputation systems against manipulations have been widely studied. However, the study of how to use the reputation values computed by those systems are rare. In this paper, we draw the analogy between reputation systems and multi-armed bandit problems. We investigate how to use the multi-armed bandit selection policies in order to increase the robustness of reputation systems against malicious agents. To this end, we propose a model of an abstract service sharing system which uses such a bandit-based reputation system. Finally, in an empirical study, we show that some multi-armed bandits policies are more robust against manipulations but cost-free for the malicious agents whereas some other policies are manipulable but costly.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adar, E., Huberman, B.A.: Free riding on Gnutella. First Monday (2000)

    Google Scholar 

  2. Dini, F., Spagnolo, G.: Buying reputation on eBay: Do recent changes help? IJEB, 581–598 (2009)

    Google Scholar 

  3. Marsh, S.P.: Formalising trust as a computational concept. PhD thesis, University of Stirling (1994)

    Google Scholar 

  4. Resnick, P., Kuwabara, K., Zeckhauser, R., Friedman, E.: Reputation systems. ACM Communications, 45–48 (2000)

    Google Scholar 

  5. Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the Web. Technical report, Stanford InfoLab (1999)

    Google Scholar 

  6. Jøsang, A., Ismail, R.: The Beta reputation system. In: 15th BledEC, pp. 41–55 (2002)

    Google Scholar 

  7. Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The EigenTrust algorithm for reputation management inP2P networks. In: 12th WWW, pp. 640–651 (2003)

    Google Scholar 

  8. Jøsang, A., Ismail, R., Boyd, C.: A survey of trust and reputation systems for online service provision. Decision Support Systems, 618–644 (2007)

    Google Scholar 

  9. Rahbar, A.G.P., Yang, O.: PowerTrust: A robust and scalable reputation system for trusted peer-to-peer computing. In: IEEE PDS, pp. 460–473 (2007)

    Google Scholar 

  10. Hoffman, K., Zage, D., Nita-Rotaru, C.: A survey of attack and defense techniques for reputation systems. CSUR (2009)

    Google Scholar 

  11. Altman, A., Tennenholtz, M.: An axiomatic approach to personalized ranking systems. JACM (2010)

    Google Scholar 

  12. Cheng, A., Friedman, E.: Manipulability of PageRank under Sybil strategies. In: 1st NETECON (2006)

    Google Scholar 

  13. Cheng, A., Friedman, E.: Sybilproof reputation mechanisms. In: 3rd P2PECON, pp. 128–132 (2005)

    Google Scholar 

  14. Srivatsa, M., Xiong, L., Liu, L.: TrustGuard: countering vulnerabilities in reputation management for decentralized overlay networks. In: 14th WWW, pp. 422–431 (2005)

    Google Scholar 

  15. Pinyol, I., Sabater-Mir, J.: Computational trust and reputation models for open multi-agent systems: a review. Artificial Intelligence Review, 1–25 (2013)

    Google Scholar 

  16. Robbins, H.: Some aspects of the sequential design of experiments. Bulletin of the AMS, 527–535 (1952)

    Google Scholar 

  17. Liu, K., Zhao, Q.: Distributed learning in multi-armed bandit with multiple players. IEEE SP, 5667–5681 (2010)

    Google Scholar 

  18. Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: Gambling in a rigged casino: the adversarial multi-armed bandit problem. In: 36th FOCS (1995)

    Google Scholar 

  19. Vermorel, J., Mohri, M.: Multi-armed bandit algorithms and empirical evaluation. In: 16th ECM, pp. 437–448 (2005)

    Google Scholar 

  20. Auer, P., Ortner, R.: UCB revisited: Improved regret bounds for the stochastic multi-armed bandit problem. In: Periodica Mathematica Hungarica, pp. 55–65 (2010)

    Google Scholar 

  21. Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. In: Machine Learning, pp. 235–256 (2002)

    Google Scholar 

  22. Wang, Y., Audibert, J.Y., Munos, R.: Algorithms for infinitely many-armed bandits. In: NIPS, pp. 1729–1736 (2008)

    Google Scholar 

  23. Douceur, J.R.: The Sybil attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 251–260. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Vallée, T., Bonnet, G., Bourdon, F. (2014). Multi-Armed Bandit Policies for Reputation Systems. In: Demazeau, Y., Zambonelli, F., Corchado, J.M., Bajo, J. (eds) Advances in Practical Applications of Heterogeneous Multi-Agent Systems. The PAAMS Collection. PAAMS 2014. Lecture Notes in Computer Science(), vol 8473. Springer, Cham. https://doi.org/10.1007/978-3-319-07551-8_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07551-8_24

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07550-1

  • Online ISBN: 978-3-319-07551-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics