Distributed algorithms for dynamic survivability of multiagent systems

V. S. Subrahmanian*, Sarit Kraus, Yingqian Zhang

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations


Though multiagent systems (MASs) are being increasingly used, few methods exist to ensure survivability of MASs. All existing methods suffer from two flaws. First, a centralized survivability algorithm (CSA) ensures survivability of the MAS - unfortunately, if the node on which the CSA exists goes down, the survivability of the MAS is questionable. Second, no mechanism exists to change how the MAS is deployed when external factors trigger a re-evaluation of the survivability of the MAS. In this paper, we present three algorithms to address these two important problems. Our algorithms can be built on top of any CSA. Our algorithms are completely distributed and can handle external triggers to compute a new deployment. We report on experiments assessing the efficiency of these algorithms.

Original languageEnglish (US)
Pages (from-to)1-15
Number of pages15
JournalLecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
StatePublished - 2004
Externally publishedYes
Event4th International Workshop CLIMA IV: Computational Logic in Multi-Agent Systems - Fort Lauderdale, FL, United States
Duration: Jan 6 2004Jan 7 2004

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Distributed algorithms for dynamic survivability of multiagent systems'. Together they form a unique fingerprint.

Cite this