Optimal agent selection

Fatma Özcan, V. S. Subrahmanian, Leana Golubchik

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The Internet contains a vast array of sources that provide identical or similar services. When an agent needs to solve a problem, it may split the problem into “subproblems” and find an agent to solve each of the subproblems. Later, it may combine the results of these subproblems to solve the original problem. In this case, the agent is faced with the task of determining to which agents to assign the subproblems. We call this the agent selection problem (ASP for short). Solving ASP is complex because it must take into account several different parameters. For instance, different agents might take different amounts of time to process a request. Different agents might provide varying “qualities” of answers. Network latencies associated with different agents might vary. In this paper, we first formalize the agent selection problem and show that it is NP-hard. We then propose a generic cost function that is general enough to take into account the costs of (i) network and server loads, (ii) source computations, and (iii) internal mediator costs. We then develop exact and heuristic based algorithms to solve the agent selection problem.

Original languageEnglish (US)
Title of host publicationKI 2001
Subtitle of host publicationAdvances in Artificial Intelligence - Joint German/Austrian Conference on AI, Proceedings
EditorsFranz Baader, Gerhard Brewka, Thomas Eiter
PublisherSpringer Verlag
Pages2-17
Number of pages16
ISBN (Print)9783540454229
DOIs
StatePublished - 2001
Externally publishedYes
EventJoint 24th German Conference on Artificial Intelligence and 9th Austrian Conference on Artificial Intelligence, KI 2001 - Vienna, Austria
Duration: Sep 19 2001Sep 21 2001

Publication series

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

Conference

ConferenceJoint 24th German Conference on Artificial Intelligence and 9th Austrian Conference on Artificial Intelligence, KI 2001
Country/TerritoryAustria
CityVienna
Period9/19/019/21/01

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Optimal agent selection'. Together they form a unique fingerprint.

Cite this