Robust multi-agent optimization: coping with Byzantine agents with input redundancy

DOI10.1007/978-3-319-49259-9_29MaRDI QIDQ2007916zbMATH OpenOpenAlexFDO

Authors Lili Su, Nitin H. Vaidya

Publication date 22 November 2019

Full work available at URL https://doi.org/10.1007/978-3-319-49259-9_29

zbMATH Keywords

Byzantine faultscoding theorydistributed optimizationmulti-agent networkredundancysecurity

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Agent technology and artificial intelligence (68T42) Distributed algorithms (68W15)

Recommendations

• Fault-Tolerant Multi-Agent Optimization
• Robust networked multiagent optimization: designing agents to repair their own utility functions
• A resilient distributed optimization algorithm based on consensus of multi-agent system against two attack scenarios
• Inexact dual averaging method for distributed multi-agent optimization
• A new class of distributed optimization algorithms: application to regression of distributed data

Cited in

(6)

• On the probabilistic feasibility of solutions in multi-agent optimization problems under uncertainty
• Byzantine-Resilient Multiagent Optimization
• Fault-Tolerant Multi-Agent Optimization
• Brief announcement: Byzantine-tolerant machine learning
• Robust networked multiagent optimization: designing agents to repair their own utility functions
• Robust utility design in distributed resource allocation problems with defective agents

This page was built for publication: Robust multi-agent optimization: coping with Byzantine agents with input redundancy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007916)