agents

Introduction to the special issue on NorMAS 2009

Tipo de Publicación:

Journal Article

Origen:

Journal of Logic and Computation, Oxford University Press , Volumen23, Ejemplar2, p.307-308 (2013)

Palabras clave:

Norms; nomrative MAS

Resumen:

In March 2009, the fourth NorMAS (Normative Multi-agent Systems) was held at Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, around 30 invited participants presented their current research, and discussed ongoing work and open problems discussed. This special issue presents a few of the papers discussing formals models (both logic and computational implementations) and normative concepts of relevance to the area.

Opening the black box of trust: reasoning about trust models in a BDI agent

Tipo de Publicación:

Journal Article

Origen:

Journal of Logic and Computation, Oxford University Press (En prensa)

Resumen:

Trust models as thus far described in the literature can be seen as a monolithic structure: a trust model is provided with a variety of inputs and the model performs calculations, resulting in a trust evaluation as output. The agent has no direct method of adapting its trust model to its needs in a given context. In this article, we propose a first step in allowing an agent to reason about its trust model, by providing a method for incorporating a computational trust model into the cognitive architecture of the agent. By reasoning about the factors that influence the trust calculation the agent can effect changes in the computational process, thus proactively adapting its trust model. We give a declarative formalization of this system using a multi-context system and we show that three contemporary trust models, BRS, ReGReT and ForTrust can be incorporated into a BDI reasoning system using our framework.

Self-Conguring Sensors for Uncharted Environments

Tipo de Publicación:

Conference Paper

Origen:

The Second Workshop on Cooperative Games in Multiagent Systems (CoopMAS-2011) . Workshop co-located with AAMAS-2011, Taipei, Taiiwan (2011)

Palabras clave:

agents; self-organisation

Reward-based region optimal quality guarantees

Tipo de Publicación:

Conference Paper

Origen:

Fourth International Workshop on Optimisation in Multi-Agent Systems at AAMAS 2011, Taipei (Taiwan) (2011)

Weaving a Fabric of Socially Aware Agents

Tipo de Publicación:

Conference Paper

Origen:

The 14th International Conference on Principles and Practice of Multi-Agent Systems (PRIMA-2011), Springer, Wollongong, Australia, p.263-274 (2011)

Palabras clave:

agents

Sequential mixed auctions

Tipo de Publicación:

Conference Paper

Origen:

The 13th IEEE International Conference on Electronic Commerce, Liverpool, UK (2011)

Palabras clave:

agents; auctions; optimization

Solving Sequential Mixed Auctions with Integer Programming

Tipo de Publicación:

Conference Paper

Origen:

CAEPIA, Springer, Volumen7023, Tenerife, Spain, p.42-53 (2011)

Trust Alignment: a Sine Qua Non of Open Multi-Agent Systems

Tipo de Publicación:

Conference Paper

Origen:

On the Move to Meaningful Internet Systems: OTM 2011., Springer, Volumen7044, Hersonissos, Greece, p.182-199 (2011)

Resumen:

In open multi-agent systems trust is necessary to improve cooperation by enabling agents to choose good partners. Most trust models work by taking, in addition to direct experiences, other agents’ communicated evaluations into account. However, in an open multi-agent system other agents may use different trust models and as such the evaluations they communicate are based on different principles. This article shows that trust alignment is a crucial tool in this communication. Furthermore we show that trust alignment improves significantly if the description of
the evidence, upon which a trust evaluation is based, is taken into account.

Improving function filtering for computationally demanding DCOPs

Tipo de Publicación:

Conference Paper

Origen:

Workshop on Distributed Constraint Reasoning at IJCAI 2011, Barcelona, p.99-111 (2011)

Resumen:

In this paper we focus on solving DCOPs in computationally demanding scenarios. GDL optimally solves DCOPs, but requires exponentially large cost functions, being impractical in such settings. Function filtering is a technique that reduces the size of cost functions. We improve the effectiveness of function filtering to reduce the amount of resources required to optimally solve DCOPs. As a result, we enlarge the range of problems solvable by algorithms employing function filtering.

Empirical hardness for mixed auctions

Tipo de Publicación:

Book Chapter

Origen:

Lecture notes in computer science, Springer, Volumen5988, p.161-170 (2010)

Distribuir contenido