cs.MASep 28, 2026

Bregman Consensus

Authors: Andrei N. Soklakov

Abstract

Consider a community of agents who are seeking consensus on a set of parameters. The agents agree to use the same Bregman-type divergence to quantify disagreement between their individual estimates of the parameters but have varying confidence in each other's abilities. Each agent is happy to revise their estimate by moving to the weighted barycenter of all individual estimates with higher weights applied to more trusted agents. We show that such revisions naturally lead to an iterative algorithm which converges to a unique consensus estimate of the parameters. Furthermore, since the consensus estimate is itself a barycenter with computable weights, the group emerges as a collective super-agent with a well-formed opinion regarding the ability of each individual agent.

Explore similar work

CardsList
  1. The Cost of Consensus: Malignant Epistemic Herding and Adaptive Gating in Distributed Multi-Agent Search

    May 7, 2026David Farr, Iain Cruickshank, Kate Starbird +1Multi-Agent CoordinationMulti-Agent Planning

  2. Beyond Consensus: Trace-Level Synthesis in Mixture of Agents

    May 27, 2026Shreyas Fadnavis, Praitayini Kanakaraj, Felix WyssReasoning TracesTraces