Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Byzantine-Resilient Multi-Agent System
 
research article

Byzantine-Resilient Multi-Agent System

Guerraoui, Rachid  
•
Maurer, Alexandre  
November 1, 2022
Ieee Transactions On Dependable And Secure Computing

We consider the problem of making a multi-agent system (MAS) resilient to Byzantine failures through replication. We consider a very general model of MAS, where randomness can be involved in the behavior of each agent. We propose the first universal scheme to make such a MAS Byzantine-resilient.

  • Details
  • Metrics
Type
research article
DOI
10.1109/TDSC.2021.3116488
Web of Science ID

WOS:000881987900031

Author(s)
Guerraoui, Rachid  
Maurer, Alexandre  
Date Issued

2022-11-01

Publisher

IEEE COMPUTER SOC

Published in
Ieee Transactions On Dependable And Secure Computing
Volume

19

Issue

6

Start page

4032

End page

4038

Subjects

Computer Science, Hardware & Architecture

•

Computer Science, Information Systems

•

Computer Science, Software Engineering

•

Computer Science

•

multi-agent systems

•

machine learning

•

clustering algorithms

•

clocks

•

probabilistic logic

•

machine learning algorithms

•

cryptography

•

distributed systems

•

fault tolerance

•

reliability and robustness

•

fault-tolerance

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
DCL  
Available on Infoscience
December 5, 2022
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/192933
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés