Service selection in stochastic environments: a learning-automaton based solution

In this paper, we propose a novel solution to the problem of identifying services of high quality. The reported solutions to this problem have, in one way or the other, resorted to using so-called “Reputation Systems” (RSs). Although these systems can offer generic recommendations by aggregating user-provided opinions about the quality of the services under consideration, they are, understandably, prone to “ballot stuffing” and “badmouthing” in a competitive marketplace. In general, unfair ratings may degrade the trustworthiness of RSs, and additionally, changes in the quality of service, over time, can render previous ratings unreliable. As opposed to the reported solutions, in this paper, we propose to solve the problem using tools provided by Learning Automata (LA), which have proven properties capable of learning the optimal action when operating in unknown stochastic environments. Furthermore, they combine rapid and accurate convergence with low computational complexity. In addition to its computational simplicity, unlike most reported approaches, our scheme does not require prior knowledge of the degree of any of the above mentioned problems associated with RSs. Instead, it gradually learns the identity and characteristics of the users which provide fair ratings, and of those who provide unfair ratings, even when these are a consequence of them making unintentional mistakes.Comprehensive empirical results show that our LA-based scheme efficiently handles any degree of unfair ratings (as long as these ratings are binary—the extension to non-binary ratings is “trivial”, if we use the S-model of LA computations instead of the P-model). Furthermore, if the quality of services and/or the trustworthiness of the users change, our scheme is able to robustly track such changes over time. Finally, the scheme is ideal for decentralized processing. Accordingly, we believe that our LA-based scheme forms a promising basis for improving the performance of RSs in general.

[1]  B. John Oommen,et al.  Graph Partitioning Using Learning Automata , 1996, IEEE Trans. Computers.

[2]  André Carlos Ponce de Leon Ferreira de Carvalho,et al.  Combining Intelligent Techniques for Sensor Fusion , 2004, Applied Intelligence.

[3]  Donghai Guan,et al.  The small-world trust network , 2011, Applied Intelligence.

[4]  Jean-Yves Le Boudec,et al.  Analysis of a reputation system for mobile ad-hoc networks with liars , 2005, Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'05).

[5]  Kaddour Najim,et al.  Learning automata and stochastic optimization , 1997 .

[6]  C. Shapiro Consumer Information, Product Quality, and Seller Reputation , 1982 .

[7]  Felix A. Fischer,et al.  Cooperative Information Agents XI , 2008 .

[8]  Audun Jøsang,et al.  A survey of trust and reputation systems for online service provision , 2007, Decis. Support Syst..

[9]  Giorgos Zacharia,et al.  Trust management through reputation mechanisms , 2000, Appl. Artif. Intell..

[10]  Hakan Altinçay,et al.  On the independence requirement in Dempster-Shafer theory for combining classifiers providing statistical evidence , 2006, Applied Intelligence.

[11]  M. Thathachar,et al.  Networks of Learning Automata: Techniques for Online Stochastic Optimization , 2003 .

[12]  Sandip Sen,et al.  Robustness of reputation-based trust: boolean case , 2002, AAMAS '02.

[13]  Chrysanthos Dellarocas,et al.  Immunizing online reputation reporting systems against unfair ratings and discriminatory behavior , 2000, EC '00.

[14]  Karl Aberer,et al.  A Probabilistic Approach to Predict Peers? Performance in P2P Networks , 2004, CIA.

[15]  Xinde Li,et al.  Fusion of imprecise qualitative information , 2010, Applied Intelligence.

[16]  P. S. Sastry,et al.  Varieties of learning automata: an overview , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[17]  M. L. Tsetlin,et al.  Automaton theory and modeling of biological systems , 1973 .

[18]  Clement T. Yu,et al.  Improvements to an Algorithm for Equipartitioning , 1990, IEEE Trans. Computers.

[19]  A. Jøsang,et al.  Filtering Out Unfair Ratings in Bayesian Reputation Systems , 2004 .

[20]  Reda Alhajj,et al.  Fraudulent and malicious sites on the web , 2009, Applied Intelligence.

[21]  B. John Oommen,et al.  Generalized pursuit learning schemes: new families of continuous and discretized learning automata , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[22]  Jaswinder Pal Singh,et al.  Computing and using reputations for internet ratings , 2001, EC '01.

[23]  B. John Oommen,et al.  Deterministic Learning Automata Solutions to the Equipartitioning Problem , 1988, IEEE Trans. Computers.

[24]  Kumpati S. Narendra,et al.  Learning automata - an introduction , 1989 .

[25]  Jean-Yves Le Boudec,et al.  Analysis of a reputation system for Mobile Ad-Hoc Networks with liars , 2008, Perform. Evaluation.

[26]  B. John Oommen,et al.  Stochastic Automata Solutions to the Object Partitioning Problem , 1991, Comput. J..

[27]  B. John Oommen,et al.  Fast Learning Automaton-Based Image Examination and Retrieval , 1993, Comput. J..

[28]  S. Buchegger,et al.  A Robust Reputation System for Mobile Ad-hoc Networks , 2003 .

[29]  Piotr Indyk,et al.  Maintaining Stream Statistics over Sliding Windows , 2002, SIAM J. Comput..

[30]  Manfred K. Warmuth,et al.  The weighted majority algorithm , 1989, 30th Annual Symposium on Foundations of Computer Science.

[31]  Munindar P. Singh,et al.  Detecting deception in reputation management , 2003, AAMAS '03.