An Analytic Approach to Reputation Ranking of Participants in Online Transactions
2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology
In our setup, agents from a community interact in pairwise transactions across discrete time. Each agent reports its evaluation of another agent with which it has just had a transaction to a central system. This system uses these timesequences of experience evaluations to infer how much the agents trust each another. Our paper proposes rationality assumptions (also called postulates or constraints) that such inferences must obey, and proceeds to derive theorems implied by these assumptions. A
... se assumptions. A basic representation theorem is proved. The system also uses these pairwise crossagent trustworthiness to compute a reputation rank for each agent. Moreover, it provides with each reputation rank an estimate of the reliability, which we call weight of evidence. This paper is different from much of the current work in that it examines how a central system which computes trustworthiness, reputation and weight of evidence is constrained by such rationality postulates.