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

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.

[1]  Ramon Sangüesa,et al.  Extracting reputation in multi agent systems by means of social network topology , 2002, AAMAS '02.

[2]  C. Hauert,et al.  Reputation-based partner choice promotes cooperation in social networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  K. Suzanne Barber,et al.  Dynamically learning sources of trust information: experience vs. reputation , 2007, AAMAS '07.

[4]  Yoav Shoham,et al.  Fair Seeding in Knockout Tournaments , 2011, TIST.

[5]  Fernando Vega-Redondo,et al.  Complex Social Networks: Searching in Social Networks , 2007 .

[6]  Jaana Kekäläinen,et al.  Cumulated gain-based evaluation of IR techniques , 2002, TOIS.

[7]  W. Raub,et al.  Reputation and Efficiency in Social Interactions: An Example of Network Effects , 1990, American Journal of Sociology.

[8]  Moshe Tennenholtz,et al.  Ranking systems: the PageRank axioms , 2005, EC '05.

[9]  Paul Resnick,et al.  Reputation systems , 2000, CACM.

[10]  Peter C. Fishburn,et al.  Chapter 4 Voting procedures , 2002 .

[11]  Sumit Chopra,et al.  Two of a Kind or the Ratings Game? Adaptive Pairwise Preferences and Latent Factor Models , 2010, ICDM.

[12]  Yoav Shoham,et al.  On the complexity of schedule control problems for knockout tournaments , 2009, AAMAS.

[13]  Vincent Conitzer,et al.  Eliciting single-peaked preferences using comparison queries , 2007, AAMAS '07.

[14]  Devavrat Shah,et al.  Iterative ranking from pair-wise comparisons , 2012, NIPS.