Agent Network Topology and Complexity

Xiaolong Jin; Jiming Liu

doi:10.1145/860575.860775

Agent Network Topology and Complexity

Xiaolong Jin, Jiming Liu

Department of Computer Science

Research output: Contribution to conference › Conference paper › peer-review

5 Citations (Scopus)

Abstract

In this paper, we examine two multi-agent based representations of SATs and further experimentally study the topologies of resulting agent networks. We show that different representations will make agent networks manifest different topologies. In one presentation, the resulting agent network show obviously small-world topologies. Generally speaking, a small-world topology will computationally harden a search process. Therefore, we propose a guiding design principle that to solve a search problem by a multi-agent system, it should avoid having small-worlds among agents and it should maintain balanced intra- and inter- agent computational complexity.

Original language	English
Pages	1020-1021
Number of pages	2
DOIs	https://doi.org/10.1145/860575.860775
Publication status	Published - 2003
Event	Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 03 - Melbourne, Vic., Australia Duration: 14 Jul 2003 → 18 Jul 2003

Conference

Conference	Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 03
Country/Territory	Australia
City	Melbourne, Vic.
Period	14/07/03 → 18/07/03

Scopus Subject Areas

Engineering(all)

User-Defined Keywords

Agent network
Computational complexity
Small-world

Access to Document

10.1145/860575.860775

Cite this

@conference{b3d879db1784445ea9366f63dbe959c9,

title = "Agent Network Topology and Complexity",

abstract = "In this paper, we examine two multi-agent based representations of SATs and further experimentally study the topologies of resulting agent networks. We show that different representations will make agent networks manifest different topologies. In one presentation, the resulting agent network show obviously small-world topologies. Generally speaking, a small-world topology will computationally harden a search process. Therefore, we propose a guiding design principle that to solve a search problem by a multi-agent system, it should avoid having small-worlds among agents and it should maintain balanced intra- and inter- agent computational complexity.",

keywords = "Agent network, Computational complexity, Small-world",

author = "Xiaolong Jin and Jiming Liu",

note = "Copyright: Copyright 2020 Elsevier B.V., All rights reserved.; Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 03 ; Conference date: 14-07-2003 Through 18-07-2003",

year = "2003",

doi = "10.1145/860575.860775",

language = "English",

pages = "1020--1021",

}

TY - CONF

T1 - Agent Network Topology and Complexity

AU - Jin, Xiaolong

AU - Liu, Jiming

PY - 2003

Y1 - 2003

N2 - In this paper, we examine two multi-agent based representations of SATs and further experimentally study the topologies of resulting agent networks. We show that different representations will make agent networks manifest different topologies. In one presentation, the resulting agent network show obviously small-world topologies. Generally speaking, a small-world topology will computationally harden a search process. Therefore, we propose a guiding design principle that to solve a search problem by a multi-agent system, it should avoid having small-worlds among agents and it should maintain balanced intra- and inter- agent computational complexity.

AB - In this paper, we examine two multi-agent based representations of SATs and further experimentally study the topologies of resulting agent networks. We show that different representations will make agent networks manifest different topologies. In one presentation, the resulting agent network show obviously small-world topologies. Generally speaking, a small-world topology will computationally harden a search process. Therefore, we propose a guiding design principle that to solve a search problem by a multi-agent system, it should avoid having small-worlds among agents and it should maintain balanced intra- and inter- agent computational complexity.

KW - Agent network

KW - Computational complexity

KW - Small-world

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

U2 - 10.1145/860575.860775

DO - 10.1145/860575.860775

M3 - Conference paper

AN - SCOPUS:1142280410

SP - 1020

EP - 1021

T2 - Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 03

Y2 - 14 July 2003 through 18 July 2003

ER -

Agent Network Topology and Complexity

Abstract

Conference

Scopus Subject Areas

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this