The Robotics Institute
Search the site
RI | Publications | A Polynomial Kernel-Oriented Coalition Algorithm for Rational Information Agents

Text only version of this site

A Polynomial Kernel-Oriented Coalition Algorithm for Rational Information Agents
M. Klusch and O. Shehory
Proc. Second International Conference on Multi-Agent Systems, AAAI Press, December, 1996, pp. 157 - 164.

Jump to: Download | Abstract | Notes | Text Reference | BibTeX Reference

Download [Help]

Adobe portable document format (pdf) [318 KB]
Compressed postscript (ps.gz) [98 KB]

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

Information agents behave like active intelligent front-ends of stand-alone information systems. The main purpose of such an agent is to gather intensionally relevant information in non-local domains. They may either work as individuals or efficientlycooperate in order to satisfy their own set of given information search tasks. However, in particular the need to respect the database autonomy requirements and to cope with semantic heterogeneity hinders such a cooperation. In this paper we present a solution for handling the autonomy during decentralized information-gathering by rational cooperation. For this purpose, methods for terminological knowledge representation and inference, as well as for utilitarian coalition formation among the information agents, are used. The decentralized agent-utility calculation bases on the agent's productions, resulting from executing tasks of fi nding dependencies between local terminological information models. There is no prior need nor a possibility to browse through foreign database schemas in order to fi nd some possibly relevant data. The coalition algorithm proposed in this paper enables efficient cooperation via the formation of Kernel-oriented stable coalitions among rationally cooperating information agents in polynomial time.

Notes

Sponsor: NSF IRI-9423967 and Israeli Ministry of Science 6288

Text Reference

M. Klusch and O. Shehory, "A Polynomial Kernel-Oriented Coalition Algorithm for Rational Information Agents," Proc. Second International Conference on Multi-Agent Systems, AAAI Press, December, 1996, pp. 157 - 164.

BibTeX Reference

@inproceedings{Klusch_1996_1150,
   author = "Matthias Klusch and Onn Shehory",
   title = "A Polynomial Kernel-Oriented Coalition Algorithm for Rational Information Agents",
   booktitle = "Proc. Second International Conference on Multi-Agent Systems",
   month = "December",
   year = "1996",
   pages = "157 - 164",
   publisher = "AAAI Press"
}


The Robotics Institute is part of the School of Computer Science, Carnegie Mellon University.
For updates and comments, please see these instructions.
This page maintained by robotwebmaster@ri.cmu.edu