Strategies for querying information agents

Prasad Chalasani, Somesh Jha, Onn Shehory, Katia Sycara

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


In a simple cooperative MAS model where a collection of “querying agents” can send queries to a collection of “information agents”, we formalize the problem of designing strategies so that the expected completion time of the queries is minimized, when every querying agent uses the same strategy. We devise a provably optimal strategy for the static case with no query arrivals, and show via simulations that the same strategy performs well when queries arrive with a certain probability. We also consider issues such as whether or not the expected completion time can be reduced by sending multiple copies of queries, or by aborting copies of answered queries.

Original languageEnglish
Title of host publicationCooperative Information Agents II
Subtitle of host publicationLearning, Mobility and Electronic Commerce for Information Discovery on the Internet - 2nd International Workshop, CIA 1998, Proceedings
EditorsMatthias Klusch, Gerhard Weiß
PublisherSpringer Verlag
Number of pages14
ISBN (Print)3540646760, 9783540646761
StatePublished - 1998
Externally publishedYes
Event2nd International Workshop on Cooperative Information Agents, CIA 1998 - Paris, France
Duration: 4 Jul 19987 Jul 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference2nd International Workshop on Cooperative Information Agents, CIA 1998

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1998.


Dive into the research topics of 'Strategies for querying information agents'. Together they form a unique fingerprint.

Cite this