Skip to main content
View expanded cover

Agreement Technologies pp 165–179Cite as

Extracting Reputation with Knock-Out Tournament-Based Pairwise Elicitation in Complex Social Networks

  • Conference paper

  • 424 Accesses

Part of the Lecture Notes in Computer Science book series (LNAI,volume 8068)

Abstract

Complex social networks are typically used in order to represent and structure social relationships that do not follow a predictable pattern of behaviour. Due to their openness and dynamics, participants in these networks have to constantly deal with uncertainty prior to commencing in any type of interaction. Reputation appears as a key concept helping users to mitigate such uncertainty. However, most of the reputation mechanisms proposed in the literature suffer from problems such as the subjectivity in the opinions and their inaccurate aggregation. With these problems in mind, this paper presents a decentralized reputation mechanism based on the concepts of pairwise elicitation processes and knock-out tournaments. The main objective of this mechanism is to build reputation rankings from qualitative opinions, so getting rid of the subjectivity problems associated with the aggregation of quantitative opinions. The proposed approach is evaluated in a real environment by using a dataset extracted from MovieLens.

Keywords

  • Ground Truth
  • Reputation System
  • Reputation Mechanism
  • Subjectivity Problem
  • Discount Cumulative Gain

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-642-39860-5_13
  • Chapter length: 15 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   39.99
Price excludes VAT (USA)
  • ISBN: 978-3-642-39860-5
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   54.99
Price excludes VAT (USA)
Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Altman, A., Tennenholtz, M.: Ranking systems: the pagerank axioms. In: Proceedings of the 6th ACM Conference on Electronic Commerce, EC 2005, pp. 1–8. ACM, New York (2005)

    Google Scholar 

  2. Balakrishnan, S., Chopra, S.: Two of a kind or the ratings game? adaptive pairwise preferences and latent factor models. In: Proceedings of the 2010 IEEE International Conference on Data Mining, ICDM 2010, pp. 725–730. IEEE Computer Society, Washington, DC (2010)

    CrossRef  Google Scholar 

  3. Brams, S.J., Fishburn, P.C.: Voting procedures. In: Arrow, K.J., Sen, A.K., Suzumura, K. (eds.) Handbook of Social Choice and Welfare, vol. 1, ch.4, pp. 173–236. Elsevier (2002)

    Google Scholar 

  4. Conitzer, V.: Eliciting single-peaked preferences using comparison queries. In: Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2007, pp. 65:1–65:8. ACM, New York (2007)

    Google Scholar 

  5. Conitzer, V., Rognlie, M., Xia, L.: Preference functions that score rankings and maximum likelihood estimation. In: Proceedings of the 21st International Joint Conference on Artifical Intelligence, IJCAI 2009, pp. 109–115. Morgan Kaufmann Publishers Inc., San Francisco (2009)

    Google Scholar 

  6. Fu, F., Hauert, C., Nowak, M.A., Wang, L.: Reputation-based partner choice promotes cooperation in social networks. Phys. Rev. E 78, 026117 (2008)

    Google Scholar 

  7. Fullam, K.K., Barber, K.S.: Dynamically learning sources of trust information: experience vs. reputation. In: Proceedings of AAMAS 2007, pp. 1055–1062. ACM, New York (2007)

    Google Scholar 

  8. Järvelin, K., Kekäläinen, J.: Cumulated gain-based evaluation of ir techniques. ACM Trans. Inf. Syst. 20(4), 422–446 (2002)

    CrossRef  Google Scholar 

  9. Negahban, S., Oh, S., Shah, D.: Iterative ranking from pair-wise comparisons. CoRR, abs/1209.1688 (2012)

    Google Scholar 

  10. Pujol, J.M., Sangüesa, R., Delgado, J.: Extracting reputation in multi agent systems by means of social network topology. In: Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems: Part 1, AAMAS 2002, pp. 467–474. ACM, New York (2002), http://doi.acm.org/10.1145/544741.544853

    CrossRef  Google Scholar 

  11. Raub, W., Weesie, J.: Reputation and efficiency in social interactions: An example of network effects. American Journal of Sociology 96, 626–654 (1990)

    CrossRef  Google Scholar 

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

    CrossRef  Google Scholar 

  13. Vega-Redondo, F.: Complex Social Networks. Cambridge University Press (2007)

    Google Scholar 

  14. Vu, T., Altman, A., Shoham, Y.: On the complexity of schedule control problems for knockout tournaments. In: Proceedings of AAMAS 2009, vol. 1, pp. 225–232. IFAAMAS, Richland (2009)

    Google Scholar 

  15. Vu, T., Shoham, Y.: Fair seeding in knockout tournaments. ACM Trans. Intell. Syst. Technol. 3(1), 9:1–9:17 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpto. de Lenguajes y Sistemas Informáticos, UNED, Spain

    Roberto Centeno

  2. School of Computer Science and Electronic Engineering, University of Essex, UK

    Ramón Hermoso & Maria Fasli

Authors
  1. Roberto Centeno
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ramón Hermoso
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maria Fasli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universidad Nacional del Sur, Bahia Blanca, Argentina

    Carlos Iván Chesñevar

  2. Universitat Politécnica de Valéncia, Camino de Vera, s/n, 46022, Valéncia, Spain

    Eva Onaindia

  3. University Rey Juan Carlos, C/Tulipán s/n, 28933, Madrid, Móstoles, Spain

    Sascha Ossowski

  4. Digital Systems, University of Piraeus, Greece

    George Vouros

Rights and permissions

Reprints and Permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Centeno, R., Hermoso, R., Fasli, M. (2013). Extracting Reputation with Knock-Out Tournament-Based Pairwise Elicitation in Complex Social Networks. In: Chesñevar, C.I., Onaindia, E., Ossowski, S., Vouros, G. (eds) Agreement Technologies. Lecture Notes in Computer Science(), vol 8068. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39860-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-39860-5_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39859-9

  • Online ISBN: 978-3-642-39860-5

  • eBook Packages: Computer ScienceComputer Science (R0)