DMCA
Robustness of reputation-based trust: Boolean Case (2002)
| Venue: | In Proceedings of the 1st International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS |
| Citations: | 62 - 4 self |
BibTeX
@INPROCEEDINGS{Sen02robustnessof,
author = {Sandip Sen and Neelima Sajja},
title = {Robustness of reputation-based trust: Boolean Case},
booktitle = {In Proceedings of the 1st International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS},
year = {2002},
pages = {288--293},
publisher = {ACM Press}
}
Share
 |
 |
 |
 |
||
OpenURL
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 di#erent averages but similar variance in performance. For selecting a processor, a user agent queries other user agents for their high/low rating of di#erent 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.
Keyphrases
user agent reputation-based trust boolean case processor agent low-performing processor target guarantee trust mechanism high-performance processor high low rating similar variance performance difference environmental parameter low-performing agent noisy reputation mechanism reputation-based trusting mechanism di erent processor inverse estimate known percentage di erent average
