With the abundance of services available in today's world, identifying those of high quality is becoming increasingly difficult. Reputation systems can offer generic recommendations by aggregating user provided opinions about service quality, however, are prone to "ballot stuffing" and "badmouthing". In general, unfair ratings may degrade the trustworthiness of reputation systems, and changes in service quality over time render previous ratings unreliable. In this paper, we provide a novel solution to the above problems based on Learning Automata (LA), which can learn the optimal action when operating in unknown stochastic environments. Furthermore, they combine rapid and accurate convergence with low computational complexity. In additional 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 with reputation systems. Instead, it gradually learns which users provide fair ratings, and which users provide unfair ratings, even when users unintentionally make mistakes. Comprehensive empirical results show that our LA based scheme efficiently handles any degree of unfair ratings (as long as ratings are binary). Furthermore, if the quality of services and/or the trustworthiness of 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 reputation systems in general.

Additional Metadata
Keywords Learning Automata, Reputation Systems, Stochastic Optimization
Persistent URL dx.doi.org/10.1007/978-3-642-13033-5_22
Series Lecture Notes in Computer Science
Yazidi, A. (Anis), Granmo, O.-C. (Ole-Christoffer), & Oommen, J. (2010). A learning automata based solution to service selection in stochastic environments. In Lecture Notes in Computer Science. doi:10.1007/978-3-642-13033-5_22