A Probabilistic Reputation Algorithm for Decentralized Multi-Agent Environments

Authors:
Mozhgan Tavakolifard;Svein J. Knapskog
Affiliations:
Centre for Quantifiable Quality of Service in Communication Systems, Norwegian University of Science and Technology, Trondheim, Norway;Centre for Quantifiable Quality of Service in Communication Systems, Norwegian University of Science and Technology, Trondheim, Norway
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 4
Cited 1

A distributed trust model

NSPW '97 Proceedings of the 1997 workshop on New security paradigms
Protecting Free Expression Online with Freenet

IEEE Internet Computing
A specification of the Agent Reputation and Trust (ART) testbed: experimentation and competition for trust in agent societies

Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Dirichlet Reputation Systems

ARES '07 Proceedings of the The Second International Conference on Availability, Reliability and Security

Trust measures for competitive agents

Knowledge-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The importance of trust in electronic transactions is well understood. The majority of current trust models consist of a central entity that verifies compliance with the trust requirements, using standardized evaluation methods and criteria. In decentralized environments, the communication scenarios are more complex, and no universally accepted objective requirements or evaluation criteria exist. It should be noted that the situation would get even more complicated when agents are interacting with each other. The goal of this research is to model trust and reputation in decentralized multi-agent systems. To achieve this, we have chosen the Ntropi model, among several other models, as a starting point, The efficiency of the model in such scenarios has been significantly improved by introducing a new probabilistic reputation algorithm for the Ntropi model.