Asymptotically idempotent aggregation operators for trust management in multi-agent systems

The study of trust management in multi-agent system, especially distributed, has grown over the last years. Trust is a complex subject that has no general consensus in literature, but has emerged the importance of reasoning about it computationally. Reputation systems takes into consideration the history of an entity’s actions/behavior in order to compute trust, collecting and aggregating ratings from members in a community. In this scenario the aggregation problem becomes fundamental, in particular depending on the environment. In this paper we describe a technique based on a class of asymptotically idempotent aggregation operators, suitable particulary for distributed anonymous environments

ASYMPTOTICALLY IDEMPOTENT AGGREGATION OPERATORS

none1This paper deals with aggregation operators. A new form of idempotency, called asymptotic idempotency, is introduced. A critical discussion of the basic notion of aggregation operator, strictly connected with asymptotic idempotency, is provided. Some general construction methods of symmetric, asymptotically idempotent aggregation operators admitting a neutral element are illustrated.noneR.GHISELLI RICCIGHISELLI RICCI, Robert

Introduction to Asymptotically Idempotent Aggregation Operators

This paper deals with aggregation operators. A new class of aggregation operators, called asymptotically idempotent, is introduced. A generalization of the basic notion of aggregation operator is provided, with an in-depth discussion of the notion of idempotency. Some general contruction methods of commutative, asymptotically idempotent aggregation operators admitting a neutral element are illustrated