Extracting reputation in multi agent systems by means of social network topology
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Reputation and social network analysis in multi-agent systems
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
An incentive compatible reputation mechanism
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Review on Computational Trust and Reputation Models
Artificial Intelligence Review
An Analytic Approach to Reputation Ranking of Participants in Online Transactions
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Organising MAS: a formal model based on organisational mechanisms
Proceedings of the 2009 ACM symposium on Applied Computing
A Hybrid Reputation Model Based on the Use of Organizations
Coordination, Organizations, Institutions and Norms in Agent Systems IV
Hi-index | 0.00 |
Reputation mechanisms, which can be used in organisational environments, have been developed during last few years as valid methods to allow agents to better select their partners. In most of works presented in the literature, reputation is summarised as a value, typically a number, that represents an opinion sent by an agent to another about a certain third party. In this work, we put forward a novel concept of reputation-based agreement in order to support the reputation definition, as well as, some desirable properties about it.We define a reputation service that collects opinions from agents, so creating agreements over situations. This service will also be in charge of presenting the information by using different informative mechanisms. On the other hand, we analyse how to enforce agents to send their opinions to the reputation service by adding incentive mechanisms. Finally, two different case studies are presented to exemplify our work.