Abstract
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 language | English |
---|---|
Title of host publication | Cooperative Information Agents II |
Subtitle of host publication | Learning, Mobility and Electronic Commerce for Information Discovery on the Internet - 2nd International Workshop, CIA 1998, Proceedings |
Editors | Matthias Klusch, Gerhard Weiß |
Publisher | Springer Verlag |
Pages | 94-107 |
Number of pages | 14 |
ISBN (Print) | 3540646760, 9783540646761 |
DOIs | |
State | Published - 1998 |
Externally published | Yes |
Event | 2nd International Workshop on Cooperative Information Agents, CIA 1998 - Paris, France Duration: 4 Jul 1998 → 7 Jul 1998 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 1435 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 2nd International Workshop on Cooperative Information Agents, CIA 1998 |
---|---|
Country/Territory | France |
City | Paris |
Period | 4/07/98 → 7/07/98 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1998.