Agent Network Topology and Complexity

Xiaolong Jin, Jiming LIU

Research output: Contribution to conferenceConference paperpeer-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 languageEnglish
Pages1020-1021
Number of pages2
DOIs
Publication statusPublished - 2003
EventSecond International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2003 - Melbourne, Vic., Australia
Duration: 14 Jul 200318 Jul 2003
https://www.ifaamas.org/AAMAS/aamas03/
https://dl.acm.org/doi/proceedings/10.1145/860575

Conference

ConferenceSecond International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2003
Country/TerritoryAustralia
CityMelbourne, Vic.
Period14/07/0318/07/03
Internet address

Scopus Subject Areas

  • Engineering(all)

User-Defined Keywords

  • Agent network
  • Computational complexity
  • Small-world

Fingerprint

Dive into the research topics of 'Agent Network Topology and Complexity'. Together they form a unique fingerprint.

Cite this