Finite-time consensus in a compromise process
Authors:
- 7 January 2026
- journal article
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 59 (1) , 015001
Abstract
A compromise process describes the evolution of opinions through binary interactions. Opinions are real numbers, and at each step, two randomly selected agents reach a compromise by averaging their pre-interaction opinions. We prove that if the number N of agents is a power of two, then consensus emerges after a finite number of compromise events with probability one; otherwise, consensus cannot be reached in a finite number of steps, provided the initial opinions are in a general position. The number of steps required to reach consensus is random for N = 2 k with k ⩾ 2 . We prove that the smallest number of steps is k ⋅ 2 k − 1 when the initial opinions are in a general position. For N = 4, we determine the distribution of the number of steps. In particular, we show that it has a purely exponential tail and compute all cumulants.Keywords
All Related Versions
Funding Information
- Portuguese Foundation of Science and Technology (UIDB/04106/2025)
This publication has 32 references indexed in Scilit:
- Explicit decay rate for the Gini index in the repeated averaging modelMathematical Methods in the Applied Sciences, 2022
- An averaging process on hypergraphsJournal of Applied Probability, 2022
- Higher order interactions destroy phase transitions in Deffuant opinion dynamics modelCommunications Physics, 2022
- Dynamics of linguistic opinion formation in bounded confidence modelInformation Fusion, 2016
- Event-based broadcasting for multi-agent average consensusAutomatica, 2013
- A Pairwise Averaging Procedure with Application to Consensus Formation in the Deffuant ModelActa Applicandae Mathematicae, 2012
- Social balance on networks: The dynamics of friendship and enmityPhysica D: Nonlinear Phenomena, 2006
- Bifurcations and patterns in compromise processesPhysica D: Nonlinear Phenomena, 2003
- Meet, discuss, and segregate!Complexity, 2002
- Signed graphsDiscrete Applied Mathematics, 1982