Partitioned multiagent systems in information oriented domains

Claudia V. Goldman; Jeffrey S. Rosenschein

doi:10.1145/301136.301155

Partitioned multiagent systems in information oriented domains

Claudia V. Goldman^*, Jeffrey S. Rosenschein

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to conference › Paper › peer-review

2 Scopus citations

Abstract

The initial step in handling multiagent systems is to partition the information domain, using an evolutionary algorithm and a similarity criterion. This partitioning step results in a group of agents, each with a particular area of expertise, assigned to handle the available information. Because of the nature of the evolutionary algorithm, the number of final agents and their assignments arise naturally from the information content of the environment, and are not determined a priori. This organization of agents, spanning the information space, can then be exploited in problem solving and information retrieval tasks. The partitioning of the information space leads to greater efficiency at run time.

Original language	American English
Pages	32-39
Number of pages	8
DOIs	https://doi.org/10.1145/301136.301155
State	Published - 1999
Event	Proceedings of the 1999 3rd International Conference on Autonomous Agents - Seattle, WA, USA Duration: 1 May 1999 → 5 May 1999

Conference

Conference	Proceedings of the 1999 3rd International Conference on Autonomous Agents
City	Seattle, WA, USA
Period	1/05/99 → 5/05/99

Access to Document

10.1145/301136.301155

Cite this

@conference{293e3b21d6ed4b4abc1c344a027f9341,

title = "Partitioned multiagent systems in information oriented domains",

abstract = "The initial step in handling multiagent systems is to partition the information domain, using an evolutionary algorithm and a similarity criterion. This partitioning step results in a group of agents, each with a particular area of expertise, assigned to handle the available information. Because of the nature of the evolutionary algorithm, the number of final agents and their assignments arise naturally from the information content of the environment, and are not determined a priori. This organization of agents, spanning the information space, can then be exploited in problem solving and information retrieval tasks. The partitioning of the information space leads to greater efficiency at run time.",

author = "Goldman, {Claudia V.} and Rosenschein, {Jeffrey S.}",

year = "1999",

doi = "10.1145/301136.301155",

language = "American English",

pages = "32--39",

note = "Proceedings of the 1999 3rd International Conference on Autonomous Agents ; Conference date: 01-05-1999 Through 05-05-1999",

}

TY - CONF

T1 - Partitioned multiagent systems in information oriented domains

AU - Goldman, Claudia V.

AU - Rosenschein, Jeffrey S.

PY - 1999

Y1 - 1999

N2 - The initial step in handling multiagent systems is to partition the information domain, using an evolutionary algorithm and a similarity criterion. This partitioning step results in a group of agents, each with a particular area of expertise, assigned to handle the available information. Because of the nature of the evolutionary algorithm, the number of final agents and their assignments arise naturally from the information content of the environment, and are not determined a priori. This organization of agents, spanning the information space, can then be exploited in problem solving and information retrieval tasks. The partitioning of the information space leads to greater efficiency at run time.

AB - The initial step in handling multiagent systems is to partition the information domain, using an evolutionary algorithm and a similarity criterion. This partitioning step results in a group of agents, each with a particular area of expertise, assigned to handle the available information. Because of the nature of the evolutionary algorithm, the number of final agents and their assignments arise naturally from the information content of the environment, and are not determined a priori. This organization of agents, spanning the information space, can then be exploited in problem solving and information retrieval tasks. The partitioning of the information space leads to greater efficiency at run time.

UR - http://www.scopus.com/inward/record.url?scp=0032676174&partnerID=8YFLogxK

U2 - 10.1145/301136.301155

DO - 10.1145/301136.301155

M3 - Paper

AN - SCOPUS:0032676174

SP - 32

EP - 39

T2 - Proceedings of the 1999 3rd International Conference on Autonomous Agents

Y2 - 1 May 1999 through 5 May 1999

ER -

Partitioned multiagent systems in information oriented domains

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this