ACM Home Page
Please provide us with feedback. Feedback
Robustness of reputation-based trust: boolean case
Full text PdfPdf (135 KB)
Source International Conference on Autonomous Agents archive
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1 table of contents
Bologna, Italy
SESSION: Session 1C: trust and reputation table of contents
Pages: 288 - 293  
Year of Publication: 2002
ISBN:1-58113-480-0
Authors
Sandip Sen  University of Tulsa, Tulsa, OK
Neelima Sajja  University of Tulsa, Tulsa, OK
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 55,   Citation Count: 21
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/544741.544808
What is a DOI?

ABSTRACT

We consider the problem of user agents selecting processor agents to processor tasks. We assume that processor agents are drawn from two populations: high and low-performing processors with different averages but similar variance in performance. For selecting a processor, a user agent queries other user agents for their high/low rating of different processors. We assume that a known percentage of "liar" users, who give inverse estimates of processors. We develop a trust mechanism that determines the number of users to query given a target guarantee threshold likelihood of choosing high-performance processors in the face of such "noisy" reputation mechanisms. We evaluate the robustness of this reputation-based trusting mechanism over varying environmental parameters like percentage of liars, performance difference and variances for high and low-performing agents, learning rates, etc.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
G.A. Akerlof. The market of lemons: Qualitative uncertainty and the market mechanism. Quarterly Journal of Economics, 84:488--500, 1970.
 
2
Amazon.com. URL: http://www.amazon.com/.
 
3
 
4
John S. Breeze, David Heckerman, and Carl Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of Fourteenth Conference on Uncertainty in Artificial Intelligence, San Francisco, CA, 1998. Morgan Kaufmann Publishers.
 
5
 
6
ebay. URL: http://www.ebay.com/.
 
7
Movie lens. URL:http://www.cs.umn.edu/Research/GroupLens/research.html/.
 
8
S.P. Marsh. Formalising Trust as a Computational Concept. PhD thesis, University of Stirling, April 1994.
 
9
Peter S. Maybeck. Stochastic models, estimation, and control, volume 141 of Mathematics in Science and Engineering. 1979.
 
10
Michael Rothschild and Joseph Stiglitz. Equlibrium in competitive insurance markets: An essay on the economics of imperfect information. The Quarterly Journal of Economics, 90(4):630--649, 1976.
 
11
 
12
Michael Schillo, Petra Funk, and Michael Rovatsos. Using trust for detecting deceiptful agents in artificial societies. Applied Artificial Intelligence, 14:825--848, 2000.
 
13
 
14
 
15
Y.H. Tan and W. Thoen. An outline of a trust model for electronic commerce. Applied Artificial Intelligence, 114(8):849--862, 2000.
 
16
Bin Yu and Munindar P. Singh. Towards a probabilistic model of distributed reputation management. In Proceedings of the Fourth Workshop on Deception, Fraud, and Trust in Agent Societies, pages 125--137, 2001.
 
17
Giorgos Zacharia and Pattie Maes. Trust management through reputation mechanisms. Applied Artificial Intelligence, 14:881--908, 2000.

CITED BY  22

Collaborative Colleagues:
Sandip Sen: colleagues
Neelima Sajja: colleagues