Elsevier

Cognitive Systems Research

Volume 5, Issue 3, September 2004, Pages 171-190
Cognitive Systems Research

Modeling cooperation in multi-agent communities

https://doi.org/10.1016/j.cogsys.2004.03.001Get rights and content

Abstract

In Multi-Agent Systems the main goal is providing fruitful cooperation among agents in order to enrich the support given to user activities. Cooperation can be implemented in many ways, depending on how local knowledge of agents is represented and consists, in general, in providing the user with an integrated view of individual knowledge bases. But the main difficulty is determining which agents are promising candidates for a fruitful cooperation among the (possibly large) universe of agents operating in the net. This paper gives a contribution in this context, by proposing a formal framework for representing and managing cooperation in multi-agent networks. Semantic properties are here represented by coefficients and adaptive algorithms permit the computation of a set of agents suggested for cooperation. Actual choices of the users modify internal parameters in such a way that the next suggestions are closer to users expectancy.

Introduction

Coordinating the activities of multiple agents is a basic task for the viability of any system in which such agents coexist. Each agent in an agent community does not have to learn only by its own discovery, but also through a cooperation with other agents, by sharing individual learned knowledge. Indeed, cooperation is often considered as one of the key concepts of agent communities (Arisha, Kraus, Ross, Ozcan, & Subrahmanian, 1998; Dagaeff, Chantemargue, & Hirsbrunner, 1997; Doran, Franklin, Jennings, & Norman, 1997; Fisher, Muller, Schroeder, Staniford, & Wagner, 1997; Gmytrasiewicz & Durfee, 2000; Iglesias, Garijo, Centeno-Gonzalez, & Velasco, 1997; Kraus, 1997; Wooldridge & Jennings, 1999). Moreover, the problem of integrating heterogeneous knowledge bases has to be considered in order to implement cooperation (Adali & Emery, 1995; Adali & Subrahmanian, 1996; Boella & Lesmo, 2001; Mundhe & Sen, 2000; Nagendra Prasad & Lesser, 1999; Peshkin, Kim, Meuleau, & Kaelbling, 2000; Sun, 2001; Xuan, Lesser, & Zilberstein, 2001). Researchers in Intelligent Agent Systems have recognized that learning and adaptation are essential mechanisms by which agents can evolve coordinated behaviors finalized to meet the knowledge of the interest domain and the requirements of the individual agents (Byrne & Edwards, 1995; Sen, 1995, Sen, 1997; Tan, 1993; Weiß, 1996). In order to realize such a cooperation, some techniques developed in the field of Machine Learning has been introduced in various Multi-Agent Systems (often denoted by MAS) (Choi & Yoo, 1999; Moukas & Maes, 1998; Wang, Liu, & Conradi, 1999).

In such a context, this paper describes a new multi-agent model, called SPY, able to inform the individual user's agent of a multi-agent network about which agents are the most appropriate to be contacted for possible knowledge integration. The main contributions of this paper are the following:

  • We point out which properties can be considered important for driving the integration of the knowledge coming from non-local agents and give a formal model in which such properties are represented as a quantitative information by means of a number of real coefficients.

  • We propose an adaptive method for determining, for a given agent a of a multi-agent net, the most appropriate agents to cooperate with a. Such a method is adaptive in the sense that it takes into account reactions of the user (by exploiting some reactive properties) and, as such, its result depends on user behavior.

  • On the basis of this model we design a strategy for supporting cooperation of agents operating in a multi-agent network. The first step consists in providing the user with a number of agent lists, each containing the most appropriate agents for cooperation, from which the user can choose agents she/he wants to contact for supporting her/his activity. The multiplicity of such choice lists depends on the multiplicity of the properties that can be used as preference criteria. Users are free to use the suggested lists even partially, or to ignore them. In any case, user's behavior induces a modification of some coefficients (describing reactive properties) in such a way that lists suggested in the future are (hopefully) closer to real user needs. Therefore, the system learns from user's behavior about how to provide her/him with suggestions meeting as much as possible their expectancy.

The plan of the paper is the following. In the following section we present related work. In Section 3, we describe how we represent agent knowledge. Section 4 includes the core of our proposal: after the definition of the semantic properties we show how to extract such properties and exploit them in order to detect good candidates for cooperation. Cooperation is implemented by merging agent knowledge bases through a technique presented in Section 5. The model is validated by a number of experiments and examples reported in Section 6. Finally, we draw our conclusion and sketch a description of a system implementation in Section 7.

Section snippets

Related work

In the context of Machine Learning approaches, Weiß (1996) illustrates the progress made in the available work on learning and adaptation in Multi-Agent Systems and provides a general survey of Multi-Agent Systems using adaptation and learning. In Tan (1993), a demonstration of how reinforcement-learning agents can learn cooperative behavior in a simulated social environment is provided, specifying that if cooperation is done intelligently, each agent can benefit from other agents instantaneous

The knowledge bases

Throughout the paper we refer to a given set of agents Λ of cardinality n and we suppose that all agents in Λ can cooperate with each other. Thus, we can see the set Λ as a undirected complete graph of agents whose arcs represent possible cooperation. W.l.o.g., we identify agents in Λ by the cardinal numbers {1,…,n}.

Extraction of the semantic properties

Besides his/her local agent, each user looks at the other agents of the net as a source of potentially interesting information in order to enrich the support to his/her activity. Interest in agents can be defined by considering some semantic properties. Such properties, useful for driving users' choices are of two types: (i) local properties, taking into account information stored in the LKBs and (ii) global properties, merging local properties with external knowledge extracted from the general

Integration of interesting knowledge bases

Cooperation between two agents is implemented in our model by the integration of their LKBs. Thus, the user of an agent i which has selected an agent j from one of the three choice lists can exploit the cooperation of j by consulting the Integrated Knowledge Base LKBij, obtained by integrating LKBi with LKBj. We show next how LKBij is defined. Once the LKBij has been computed, the integration of the knowledge of the agent j with that of the client agent i is simply implemented by replacing its

Experiments and validation

In the previous sections, we have presented a formal framework for representing cooperation among agents in a multi-agent environment. The model is based on the extraction of some semantic properties capturing both local and contextual knowledge about agents. Such properties, encoded by suitable coefficients, drive users towards selecting from the agent net the most promising candidate agents for fruitful cooperation. User choices are exploited as feedback for adapting coefficients in such a

Conclusions and complexity issues

In this paper a framework for representing and managing cooperation among agents in a Multi-Agent community is provided. The core of the proposal is the definition of a formal model based on several semantic properties and on a linear system involving some coefficients associated to such properties. The solution of such a system allows the user to find the best agents for cooperation in the net, that is those agents from which the most fruitful cooperation can be reasonably expected.

Acknowledgements

We are grateful to Gianluca Lax for useful suggestions he gave us during the final writing of this paper. This work was partially supported by the National Research Council (CNR) Project: SP1-Reti INTERNET: efficienza, integrazione e sicurezza.

References (40)

  • A. Brandt

    Multi-level adaptive solutions to boundary-value problems

    Mathematical Computing

    (1977)
  • J. Bunch et al.

    Triangular factorization and inversion by fast matrix multiplication

    Mathematical Computing

    (1974)
  • Byrne, C., & Edwards, P. (1995). Collaborating to refine knowledge. In D. Gordon (Ed.), Proceedings of the machine...
  • A. Chavez et al.

    Challenger: A multi-agent system for distributed resource allocation

  • Y.S. Choi et al.

    Multi-agent web information retrieval: Neural network based approach

  • T. Dagaeff et al.

    Emergence-based cooperation in a multi-agent system

  • J.E. Doran et al.

    On cooperation in multi-agent systems

    The Knowledge Engineering Review

    (1997)
  • M. Fisher et al.

    Methodological foundations for agent-based systems

    The Knowledge Engineering Review

    (1997)
  • Gandon, F. (2001). Engineering an ontology for a multi-agents corporate memory system. In S. Tsuchiya & J. P. Barthés...
  • P.J. Gmytrasiewicz et al.

    Rational coordination in multi-agent environments

    Autonomous Agents and Multi-Agent Systems

    (2000)
  • Cited by (0)

    A short abridged version of this paper appeared in the Proceedings of the Second International Conference on Intelligent Agent Technology 2001, pp. 44–53, World Scientific.

    View full text