# Agreement Protocols on an Arbitrary Network in the Presence of a Mobile Adversary

## TL;DR

This paper studies agreement protocols in networks with a mobile adversary controlling changing processors, improving results for complete networks and extending them to general networks.

## Contribution

It advances the understanding of agreement protocols by addressing mobile adversaries in both complete and arbitrary network topologies.

## Key findings

- Enhanced agreement protocols for complete networks with mobile adversaries
- Extended protocols to general, non-complete networks
- Improved bounds on adversary control and network resilience

## Abstract

We investigate the problem of obtaining agreement protocols in the presence of a mobile adversary, who can control an ever-changing selection of processors. We make improvements to previous results for the case when the communications network forms a complete graph, and also adapt these to the general case when the network is not complete.