Fault-Tolerant Multi-Agent Optimization

DOI10.1145/2933057.2933105zbMath1375.68206OpenAlexW2490498838MaRDI QIDQ5361966

Nitin H. Vaidya, Lili Su

Publication date: 29 September 2017

Published in: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2933057.2933105

zbMATH Keywords

distributed optimizationByzantine faultsfault-tolerant computingcomplete networks

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Distributed algorithms (68W15)

Related Items

Discussion of: ‘A review of distributed statistical inference’ ⋮ Robust Asynchronous Stochastic Gradient-Push: Asymptotically Optimal and Network-Independent Performance for Strongly Convex Functions ⋮ Resilient consensus‐based distributed optimization under deception attacks ⋮ How can machine learning and optimization help each other better? ⋮ Determining \(r\)- and \((r,s)\)-robustness of digraphs using mixed integer linear programming ⋮ On arbitrary compression for decentralized consensus and stochastic optimization over directed networks