arXiv (All)
open access
Borda Aggregation Dynamics of Preference Orderings on Networks
We introduce and analyze a discrete-time network process in which each node holds a (weak) preference ordering over a finite set of alternatives and updates by local Borda aggregation. At each step, a node forms a weighted average (row-stochastic random-walk normalization) of its neighbors' Borda sc
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Understanding the oversubscription behaviour of DragonFly+ networks#1109984
- Understanding the oversubscription behaviour of DragonFly+ networks#919296
- Distributed Algorithms for Near-Equitable Coloring#429339
- Greedy-Like Defective Coloring: Distributed Algorithms and Applications#999838
- Byzantine Reliable Broadcast with Causal Ordering#1123469
Record · ID 974375
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive