Review on Computational Trust and Reputation Models

Reference: Sabater, Sierra (2005). Artificial Intelligence Review. Source file: Review_on_Computational_Trust_and_Reputation_Model.pdf. URL

Summary

A panoramic review of computational trust and reputation models developed for multi-agent systems and electronic commerce. Sabater and Sierra classify models along several dimensions: conceptual basis (cognitive vs. game-theoretical), information sources (direct experience, witness information, sociological signals, prejudice), visibility (global vs. subjective), granularity (single- vs. multi-context), assumptions about cheating behavior, type of exchanged information, and provision of reliability measures.

The survey then applies this framework to representative models (Marsh’s early trust model, Sporas, Histos, ReGreT, AFRAS, FIRE, eBay-style mechanisms, Yu & Singh’s evidential model, etc.), identifying under-explored aspects: sociological information, multi-context reasoning, and principled handling of liars. It argues that as MAS applications grow more complex, trust models must become richer to accommodate social structures and contextual reasoning.

Key Ideas

Trust as cognitive belief vs. game-theoretic subjective probability.
Direct experience, witness (word-of-mouth), sociological signals, prejudice.
Global (online reputation) vs. subjective trust per partner.
Three levels of cheating-resistance: ignored, biasing-only, liars.
Need for multi-context, sociologically-aware trust.

Connections

Conceptual Contribution

Claim: Computational trust/reputation must be classified along several independent dimensions (conceptual basis, information sources, visibility, granularity, cheating assumptions) if models are to be compared and composed rather than merely enumerated.
Mechanism: The authors propose a multi-axis taxonomy and apply it to a dozen canonical models (Marsh, Sporas, Histos, ReGreT, AFRAS, FIRE, eBay-style aggregation, Yu & Singh), using each axis to surface gaps: sociological signals, multi-context trust, and principled liar handling are under-served despite being pivotal for realistic MAS.
Concepts introduced/used: Trust, Reputation, Direct Experience, Witness Reputation, Sociological Reputation, Prejudice, ReGreT, FIRE, Cognitive Trust, Game-Theoretic Trust
Stance: survey
Relates to: Supplies the conceptual vocabulary picked up by self-organisation work such as A Composite Self-organisation Mechanism in an Agent Network (DSmT trust fusion) and contextualises verifiability debates in Agent Communication Languages - Rethinking the Principles; links to Gossip Protocols through witness-information propagation.

Tags

#trust #reputation #multi-agent #survey

Backlinks

Summary

Singh argues that mainstream ACLs like KQML and FIPA/Arcol are built on an untenable mentalistic semantics — grounding message meaning in the sender’s beliefs and intentions — which cannot be verified from the outside and therefore cannot serve as a compliance standard. For true interoperability in heterogeneous multi-agent systems, he proposes shifting to a social agency model in which ACL semantics is defined in terms of public commitments, roles, and conventions rather than private mental states.

The paper maps the design space of ACLs along perspective (private/public), type of meaning (personal/conventional), basis (semantic/pragmatic), context (fixed/flexible), coverage (of communicative acts), and construction autonomy (design/execution). It motivates “societies” of agents with published protocols, where compliance becomes testable and dialects can usefully coexist. The move from mental to social semantics underpins later work on commitment-based protocols.

Conceptual Contribution

Claim: Mentalistic ACL semantics (KQML, FIPA/ARCOL) cannot ground interoperability because compliance with sincerity and belief conditions is externally unverifiable; ACLs should be rebuilt on a social semantics of public commitments, roles and conventions.

Mechanism: Singh maps the ACL design space along six axes — perspective (private/public), meaning type (personal/conventional), basis (semantic/pragmatic), context (fixed/flexible), coverage (communicative-act repertoire), and construction autonomy (design-time vs. run-time). He uses this scheme to argue that FIPA/KQML occupy an untenable region, and sketches a social-agency alternative in which agents belong to “societies” with published protocols, commitments are first-class, and dialects (but not idiolects) are tolerated.

Concepts introduced/used: Social Agency, Commitment-Based Semantics, Mentalistic Semantics, Conversation Policy, Dialect vs Idiolect, Design Autonomy, Execution Autonomy, ACL Verifiability

Stance: critique

Relates to: Directly targets the mentalistic stance of Agent-Oriented Programming, KQML as an Agent Communication Language, and FIPA-ACL; its social-semantic programme is operationalised by An Interaction-oriented Agent Framework for Open Environments (commitment-based Mercurio/JaCaMo) and cited approvingly by the surveys The State of the Art in Agent Communication Languages and Trends in Agent Communication Language.

Summary

The authors propose a decentralized self-organization mechanism that lets agents in a collaborative task-allocation network dynamically adapt their weighted relations (peer-to-peer and subordinate-superior) to improve overall profit. The mechanism combines two components: a Dezert-Smarandache-theory-based trust model that fuses direct experience and neighbor opinions to select candidate partners, and a multi-agent Q-learning algorithm that learns which relation-adaptation actions (enhance/weaken the relation type) pay off.

Unlike prior approaches that assume crisp binary relations, this model uses weighted relation strengths in [0,1], allowing gradual rather than sudden social change. Agents aim to minimize communication, computation, and management cost while maximizing subtask benefit. Reward matrices defined over action pairs couple the two learners so that joint optimal adaptations emerge.

Conceptual Contribution

Claim: Decentralised task-allocation networks self-organise more effectively when agents adapt weighted (rather than binary) relations via a composite mechanism that fuses a DSmT-based trust model with multi-agent Q-learning.

Mechanism: Each pair of agents maintains peer-to-peer and subordinate-superior weights in [0,1]. Candidate partners for a subtask are selected using Dezert-Smarandache-theory fusion of direct experience and neighbour opinions (handling conflicting/paradoxical evidence). A multi-agent Q-learning algorithm with coupled reward matrices learns enhance/weaken adaptation actions on those weights, optimising profit = subtask benefit − (communication + computation + management) cost.

Concepts introduced/used: Self-Organisation, Weighted Relation, Dezert-Smarandache Theory, Multi-Agent Q-Learning, Trust Fusion, Relation Adaptation, Task Allocation Network

Stance: engineering

Relates to: Operationalises ideas surveyed in Review on Computational Trust and Reputation Models (witness + direct evidence fusion); complements gossip-style information exchange in Gossip-based Aggregation in Large Dynamic Networks; the decentralised resilience theme echoes Theory of Self-Reproducing Automata.

Cognitive Trust

A family of trust models (e.g., Castelfranchi & Falcone) that represent trust as a mental attitude grounded in explicit beliefs about the trustee’s competence, willingness, and dependence, rather than as a numeric reputation score. Contrasts with game-theoretic and statistical reputation models in the Sabater–Sierra taxonomy.