Searcharxiv⌕ Search

arXiv · 0708.3220

Optimal strategies in the average consensus problem

Abstract

We prove that for a set of communicating agents to compute the average of their initial positions (average consensus problem), the optimal topology of communication is given by a de Bruijn's graph. Consensus is then reached in a finitely many steps. A more general family of strategies, constructed by block Kronecker products, is investigated and compared to Cayley strategies.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jean-Charles Delvenne, Ruggero Carli, Sandro Zampieri. 2007-08-23. Optimal strategies in the average consensus problem. https://arxiv.org/abs/0708.3220

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

KEEP EXPLORING

Related papers

ThreadBench: Benchmarking Realism in Agentic Simulation of Real-world Discussions

LLM agents are increasingly used to simulate real-world interactions, but it remains unclear whether simulated behaviors preserve the content patterns and interaction dynamics of real human behaviors. Existing evaluations often focus on individual comments or task performance, rather than whether simulated behaviors match human behavior at thread level. In this paper, we use Reddit discussions as a concrete testbed for real-world social simulation. Reddit provides public, topic-grounded, multi-party interactions with diverse opinions, experiences, and interaction patterns, making it a useful setting for evaluating whether LLM agents reproduce the distributional and structural properties of real online discussions. We introduce ThreadBench, a benchmark for Reddit discussion simulation built from 9,817 real Reddit threads spanning 8 diverse domains and 116 subdomains. ThreadBench uses statistical analyses to compare generated and real discussions across 12 metrics grouped in 4 families: uniformity, expression, tone, and interaction. We further develop Thread-Prompt-based Discussion Generation (ThreadPDG), a Planner-Writer framework that learns how a real discussion grows. The Planner produces thread- and comment-level plans from a real seed discussion, and the Writer generates comments from these plans. For each seed, we generate multiple candidate threads and combine their best branches using thread-level statistics. Across all domains and multiple LLMs, ThreadPDG achieves ThreadBench pass rates of 58-100%, compared with 0-17% for the baselines. Human evaluation with 436 annotators further shows that ThreadPDG is not distinguished from real discussions in 78.7% of pairs, outperforming existing simulation methods.

cs.MA↗

Jevolution: A Framework for Studying Communication and Collective Dynamics in AI Agents

Experiments with remote decision-making agents depend on more than the policy: the world may change during inference, the simulator determines which actions are available, and births and immigration alter who can act. We present Jevolution, an instrumented spatial predator-prey framework that makes these dependencies explicit. Its reference implementation separates the evolving world, asynchronous request scheduling, controller adapters, and experiment records. The model combines local observations, energy and resource constraints, predefined signals, and inherited scalar traits. We describe these mechanisms using the ODD protocol and distinguish implemented controls from research questions requiring additional interventions. Free synthetic fixtures exercise scheduling, signaling, and inheritance against the pinned implementation; they validate specified software behavior rather than model intelligence or ecological realism. A completed communication case study illustrates the end-to-end workflow using Jev to control both species. Across 6 complete habitat-seed pairs, the mean signals-on minus signals-off difference in normalized rabbit abundance was -0.0095 (nominal 95% pair-bootstrap interval [-0.0772, 0.0602]). This small study does not resolve the direction of the signal-system effect. The contribution is an inspectable experimental system and its evidence boundaries, not a new policy-learning algorithm or a demonstration of emergent language, adaptive selection, or biological predictive validity.

cs.MA↗

Optimize Once, Execute Fast: Latency-Aware Multi-Agent Workflow Learning for Recurrent Queries

Large Language Model-based Multi-Agent Systems (LLM-based MAS) have shown remarkable success in solving complex tasks by coordinating specialized agents through multi-step workflows. To overcome the high cost and specificity of manually designed workflows, recent research has shifted toward learning them automatically. However, a key limitation remains: while agent calls introduce significant latency due to model inference time and service congestion, most automated methods optimize solely for downstream performance, ignoring execution time (makespan). This issue is amplified when workflows are reused across recurring queries, making latency accumulate over time. This limits deployment in recurrent applications such as AI customer support and AI cloud troubleshooting, where users expect fast responses. To bridge this gap, we introduce a new problem, termed latency-aware workflow generation, where the objective is to minimize workflow makespan while aiming to retain downstream performance. We propose LAWA (Latency-Aware Workflow optimizAtion), a novel framework that reduces makespan via theoretically grounded graph edits targeting critical-path bottlenecks. By unifying a graph generator with this graph-editing procedure, LAWA supports both de novo workflow generation and refinement of existing ones. Empirical results across seven benchmarks demonstrate that LAWA significantly reduces makespan while achieving competitive task performance, supporting efficient reuse of multi-agent workflows for recurrent queries.

cs.MA↗