In this paper, we investigate the question of how to characterize “fault tolerance” in cooperative agents. It is generally admitted that cooperating agents can achieve tasks that they could not achieve without cooperation. Nevertheless, cooperating agents can have “Achilles’ heels”, a cooperative encounter can eventually fail to achieve its tasks because of the collapse of a single agent. The contribution of this paper is the study of how cooperating agents are affected by dependability issues. Specifically, our objectives are twofold: to formally define the concepts of dependability in cooperative encounters, and to analyze the computational complexity of devising dependable cooperative encounters.
CITATION STYLE
Fiorino, H., & Pellier, D. (2017). A Theory to Devise Dependable Cooperative Encounters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10621 LNAI, pp. 504–513). Springer Verlag. https://doi.org/10.1007/978-3-319-69131-2_33
Mendeley helps you to discover research relevant for your work.