Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.18812

The Geography of (Concurrent) Block Proposing

Ciamac C. Moallemi·Mallesh M. Pai·Dan Robinson·Christoph Schlegel
View original source ↗Read source document ↗Export metadata ↓

Abstract

The resilience and censorship resistance of a blockchain depend on where the validators and proposers of that blockchain physically operate. We study the economic incentives behind this location choice, both with a single proposer and with multiple concurrent proposers. Formally, we study a game where proposers first choose locations and then compete in a first-price auction for an opportunity whose common value is driven by information from geographically dispersed sources. A single proposer minimizes variance-weighted delay, locating at a weighted median of the sources and co-locating with any dominant one. By contrast, with two proposers, information both observe equally early earns no rent, and each proposer's expected profit is proportional to the standard deviation of the information it receives before its rival. We show that the location game admits the jointly unobserved variance as an ordinal potential, so global solutions of a weighted two-median problem are equilibria. With two sources, one proposer locates at each, however weak one is. With more proposers and at least as many sources, equilibrium locations are distinct under regular bidding. Multiple concurrent proposers thus do more than limit any single proposer's control over inclusion: by rewarding exclusive rather than shared information, they create an economic force toward geographic decentralization.

Explore related subjects

cs.GTecon.TH

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ciamac C. Moallemi, Mallesh M. Pai, Dan Robinson, Christoph Schlegel. 2026-10-13. The Geography of (Concurrent) Block Proposing. https://arxiv.org/abs/2610.18812

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

KEEP EXPLORING

Related papers

arXiv2026

Practical approach to $2$-Euclidean Preferences

An election is a pair $(C,V)$ of candidates and voters. Each vote is a ranking (permutation) of the candidates. An election is $d$-Euclidean if there is an embedding of both candidates and voters into $\mathbb{R}^d$ such that voter $v$ prefers candidate $a$ over $b$ if and only if $a$ is closer to $v$ than $b$ is to $v$ in the embedding. For $d\geq 2$ the problem of deciding whether $(C,V)$ is $d$-Euclidean is $\exists \mathbb{R}$-complete. In this paper, we propose a practical approach to recognizing and refuting $2$-Euclidean preferences. We design a new class of forbidden substructures that works very well on practical instances. We utilize the framework of integer linear programming (ILP) and quadratically constrained programming (QCP). We also introduce reduction rules that simplify many real-world instances significantly. Our approach beats the previous algorithm of Escoffier, Spanjaard and Tydrichová~[Algorithmic Recognition of 2-Euclidean Preferences, ECAI 2023] both in number of resolved instances and the running time. In particular, we were able to lower the number of unresolved PrefLib instances from $343$ to $60$. Moreover, $98.7\%$ of PrefLib instances are resolved in under $1$ second using our approach.

cs.GT↗
arXiv2026

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

Social media, pseudonymous identities and generative AI have made online platforms highly vulnerable to Coordinated Inauthentic Behavior: by generating large numbers of similar posts, influence campaigns create an illusion of widespread support, exploiting the tendency of users and algorithms alike to mistake frequency for consensus. Clone-robust weighting functions address this problem by assigning influence in a way that is insensitive to near-duplication, as measured by a metric, while remaining symmetric, continuous and local. While prior constructions were restricted to Euclidean spaces, we present a computationally efficient framework for arbitrary metric spaces, based on neighborhood graphs and graph weighting functions satisfying a simple locality condition. As a consequence, the visibility an attacker gains from near-duplicates is bounded independently of their number. We further argue that, in democratically sensitive settings such as news feeds, such guarantees must come with explainability, and introduce sharing coefficients that quantify how influence is transferred between elements of prior volumetric constructions. In the graph setting, we show that sharing measures based on the deletion of vertices or edges are incompatible with locality, and instead define sharing through the addition of clones. Finally, we characterize the resulting interpretability properties and construct clone-robust graph weighting functions satisfying them.

cs.GT↗
arXiv2026

Hierarchical Learning Automata Without a Shared Reinforcement Signal: Recovering the Environment Response From Action-Probability Changes

A hierarchy of learning automata in the sense of Thathachar and Ramakrishnan activates one root-to-leaf path per round, and every automaton on that path updates from the environment response. Analyses of this hierarchy deliver the response to every level. In many deployed hierarchies only the root observes it. The interfaces below carry requests but no feedback channel. This paper shows that the response can be recovered at every level without one. An active child receives one bit, the sign of the change in the action probability its parent assigns to it, and reads the response from that sign. For any update rule in which the selected action's probability rises on reward and does not rise on penalty, the decoded bit equals the response at every depth. This class includes linear reward-penalty, reward-epsilon-penalty and reward-inaction. The protocol hierarchy and the broadcast hierarchy therefore generate identical sample paths, so any convergence result proved for the broadcast hierarchy under these rules holds for the protocol hierarchy as well. The paper then analyses a proportional reward-penalty rule that keeps the allocation interior. For two actions it coincides with symmetric linear reward-penalty. For three or more it lies outside the classical schemes and balances each action's failure rate against its remaining allocation, not its penalty rate. Its mean flow converges globally to a closed-form allocation and drops actions below a computable threshold. High-precision replays on hierarchies of up to 16,384 leaves show zero decoding errors.

cs.GT↗