Node and network resistance to bribery in multi-agent systems
From MaRDI portal
Publication:826846
DOI10.1016/J.SYSCONLE.2020.104842zbMath1454.93019OpenAlexW3110951349MaRDI QIDQ826846
Carlos Silvestre, Guilherme Ramos, Daniel A. M. M. Silvestre
Publication date: 6 January 2021
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sysconle.2020.104842
Related Items (4)
An overview of structural systems theory ⋮ The robust minimal controllability and observability problem ⋮ Designing communication networks for discrete-time consensus for performance and privacy guarantees ⋮ A resilient continuous-time consensus method using a switching topology
Uses Software
Cites Work
- Unnamed Item
- Stochastic and deterministic fault detection for randomized gossip algorithms
- Effective graph resistance
- Average consensus on general strongly connected digraphs
- Discrete-time dynamic average consensus
- Resilient consensus of switched multi-agent systems
- Optimizing network robustness by edge rewiring: a general framework
- Resilient consensus of second-order agent networks: asynchronous update rules with delays
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- Distributed Averaging Using Periodic Gossiping
- Broadcast and Gossip Stochastic Average Consensus Algorithms in Directed Topologies
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
This page was built for publication: Node and network resistance to bribery in multi-agent systems
