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 time-sequences of experience evaluations to infer how much the agents trust each another. Our paper proposes rationality assumptions (also called axioms or constraints) that such inferences must obey, and proceeds to derive theorems implied by these assumptions. A basic representation theorem is proved. The system also uses these pairwise cross-agent 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.
[1]
Lars Brückner,et al.
On the Simulation of Global Reputation Systems
,
2005,
J. Artif. Soc. Soc. Simul..
[2]
Yao-Hua Tan,et al.
Trust and Deception in Virtual Societies
,
2001,
Springer Netherlands.
[3]
C. Castelfranchi,et al.
Social Trust : A Cognitive Approach
,
2000
.
[4]
Jochen Renz,et al.
Experience and Trust - A Systems-Theoretic Approach
,
2008,
ECAI.
[5]
Moshe Tennenholtz,et al.
Reputation Systems: An Axiomatic Approach
,
2004,
UAI.
[6]
Gheorghe Cosmin Silaghi,et al.
Reputation-based trust management systems and their applicability to grids
,
2007
.
[7]
Catholijn M. Jonker,et al.
Formal Analysis of Models for the Dynamics of Trust Based on Experiences
,
1999,
MAAMAW.