# Multi-Agent Consensus Subject to Communication and Privacy Constraints

arXiv: https://arxiv.org/abs/2102.10642 · HTML: https://mlsanity.com/paper/2102.10642/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 21 Feb 2021.

## Built on by (most cited first, 2 of 2)

- [On Model Protection in Federated Learning against Eavesdropping Attacks](https://mlsanity.com/paper/2504.02114/) (2025)
- [Agent-Centric Social Trajectory Prediction: A Free Energy Principle Perspective](https://mlsanity.com/paper/2605.25748/) (2026)

## Abstract (arXiv)

We consider a multi-agent consensus problem in the presence of adversarial agents. The adversaries are able to listen to the inter-agent communications and try to estimate the state of the agents. The agents have a limited bit-rate for communication and are required to quantize the transmitted signal in order to meet the bit-rate constraint of the communication channel. We propose a consensus protocol that is protected against the adversaries, i.e., the expected mean-square error of the adversary state estimate is lower bounded. In order to deal with the bit-rate constraint, we propose a dynamic quantization scheme that guarantees protected consensus.
