Dynamical Trust and Reputation Computation Model for B2C E-Commerce
AbstractTrust is one of the most important factors that influence the successful application of network service environments, such as e-commerce, wireless sensor networks, and online social networks. Computation models associated with trust and reputation have been paid special attention in both computer societies and service science in recent years. In this paper, a dynamical computation model of reputation for B2C e-commerce is proposed. Firstly, conceptions associated with trust and reputation are introduced, and the mathematical formula of trust for B2C e-commerce is given. Then a dynamical computation model of reputation is further proposed based on the conception of trust and the relationship between trust and reputation. In the proposed model, classical varying processes of reputation of B2C e-commerce are discussed. Furthermore, the iterative trust and reputation computation models are formulated via a set of difference equations based on the closed-loop feedback mechanism. Finally, a group of numerical simulation experiments are performed to illustrate the proposed model of trust and reputation. Experimental results show that the proposed model is effective in simulating the dynamical processes of trust and reputation for B2C e-commerce. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Tian, B.; Liu, K.; Chen, Y. Dynamical Trust and Reputation Computation Model for B2C E-Commerce. Future Internet 2015, 7, 405-428.
Tian B, Liu K, Chen Y. Dynamical Trust and Reputation Computation Model for B2C E-Commerce. Future Internet. 2015; 7(4):405-428.Chicago/Turabian Style
Tian, Bo; Liu, Kecheng; Chen, Yuanzhong. 2015. "Dynamical Trust and Reputation Computation Model for B2C E-Commerce." Future Internet 7, no. 4: 405-428.