Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2602.24024

Breaking the Illusion of Artificial Consensus: Clone-Robust Weighting for Arbitrary Metric Spaces

Damien Berriaud·Roger Wattenhofer
View original source ↗Read source document ↗Export metadata ↓

Abstract

Independent media are central to democratic decision-making, yet recent technological developments, such as social media, pseudonymous identities, and generative AI, have made them more vulnerable to coordinated influence campaigns--usually referred to as Coordinated Inauthentic Behavior. By automatically generating large numbers of similar messages and news reports, such campaigns create an illusion of widespread support, and exploit the tendency of human observers and aggregation mechanisms alike to treat frequency as evidence of credibility or consensus. Clone-robust weighting functions offer a solution to this problem by assigning influence in a way that is insensitive to arbitrary duplication or near-duplication, as measured by a metric. This axiomatic framework rests on three principles: symmetry (equivalent elements are treated equally), continuity (weights vary smoothly under perturbations), and clone-robustness (adding duplicates or near-duplicates does not distort the overall distribution). We provide a general construction of clone-robust weighting functions that applies to arbitrary metric spaces, is entirely independent of the underlying topology, and admits efficient computation. Our approach identifies radius graphs as a natural invariant under cloning, and builds on graph weighting functions that satisfy a basic locality condition. We explore the resulting design space, starting with a simple family that satisfies the core axioms, and then identify explainability as a guiding criterion for navigating this design space. To this end, we introduce sharing coefficients that enable meaningful comparison and interpretation of different constructions, but require additional axiomatic principles. We then consider alternative constructions based on clique-covers, and unveil approaches using clique-partitions that are grounded in information-theoretic principles.

Explore related subjects

cs.GTcs.SI

Keep this discovery

BibTeXRIS

Damien Berriaud, Roger Wattenhofer. 2026-02-27. Breaking the Illusion of Artificial Consensus: Clone-Robust Weighting for Arbitrary Metric Spaces. https://arxiv.org/abs/2602.24024

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT↗
arXiv2026

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.

cs.GT↗
arXiv2026

Existence of the Core in Approval-Based Committee Elections

We settle the main open question in the theory of approval-based multi-winner elections: we show that there always exists a committee in the core. The core is a stability and group fairness concept. The proof introduces a new voting rule that optimizes an entropy-like objective function over committees and payment systems. All local optima of this objective function lie in the core, which implies that a core committee can be found in polynomial time.

cs.GT↗