Robust Multi-agent Optimization: Coping with Byzantine Agents with Input Redundancy
Authors:
- 3 November 2016
- book chapter
- Published by Springer Nature
- p. 368-382
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- Synchronous condition-based consensusDistributed Computing, 2005
- Conditions on input vectors for consensus solvability in asynchronous distributed systemsJournal of the ACM, 2003
- Using Conditions to Expedite Consensus in Synchronous Distributed SystemsLecture Notes in Computer Science, 2003
- More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous SystemsInformation and Computation, 1993
- Distributed asynchronous deterministic and stochastic gradient optimization algorithmsIEEE Transactions on Automatic Control, 1986
- Reaching approximate agreement in the presence of faultsJournal of the ACM, 1986
- A Convergence Theorem for Non Negative Almost Supermartingales and Some Applications1985
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980
- Exponential convergence of products of stochastic matricesJournal of Mathematical Analysis and Applications, 1977