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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
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)
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)
Fu, F., Hauert, C., Nowak, M.A., Wang, L.: Reputation-based partner choice promotes cooperation in social networks. Phys. Rev. EÂ 78, 026117 (2008)
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)
Järvelin, K., Kekäläinen, J.: Cumulated gain-based evaluation of ir techniques. ACM Trans. Inf. Syst. 20(4), 422–446 (2002)
Negahban, S., Oh, S., Shah, D.: Iterative ranking from pair-wise comparisons. CoRR, abs/1209.1688 (2012)
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
Raub, W., Weesie, J.: Reputation and efficiency in social interactions: An example of network effects. American Journal of Sociology 96, 626–654 (1990)
Resnick, P., Kuwabara, K., Zeckhauser, R., Friedman, E.: Reputation systems. Commun. ACM 43(12), 45–48 (2000)
Vega-Redondo, F.: Complex Social Networks. Cambridge University Press (2007)
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)
Vu, T., Shoham, Y.: Fair seeding in knockout tournaments. ACM Trans. Intell. Syst. Technol. 3(1), 9:1–9:17 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)