Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.41284

Deterministic Implementation of Mean-Preserving Contractions

Junze Sun
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study whether randomization is needed to generate a prescribed distribution of posterior means for a one-dimensional state. Drawing on backward Monge martingale transport, we show that every mean-preserving contraction of an atomless prior with finite first moment admits a deterministic implementation. Consequently, restricting attention to deterministic signals leaves the designer's value unchanged whenever objectives and constraints depend only on the posterior-mean distribution. We decompose implementation into independent problems on non-separating intervals and describe a constructive procedure based on barcode transport. We also characterize when lower or upper contour sets can take a nested-interval form, and provide applications to monopolistic pricing with buyer-optimal learning and robust persuasion with ambiguous receiver preferences.

Explore related subjects

econ.TH

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Junze Sun. 2026-10-30. Deterministic Implementation of Mean-Preserving Contractions. https://arxiv.org/abs/2610.41284

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

KEEP EXPLORING

Related papers

arXiv2026

Action Volatility in a Changing World

We study how volatile agents' behavior is in a social learning environment with a changing state. We consider a simple sequential social learning model where rational agents arrive in order, each acting only once, and the underlying unknown state constantly evolves. Each agent receives a private signal, observes all past actions of others, and chooses an action to match the current state. Because the state changes over time, cascades cannot last forever, and actions also fluctuate. We show that actions change less often than private signals but, despite the presence of temporary information cascades, still more often than the underlying state in the long run.

econ.TH↗
arXiv2026

Fair Division with Binary Valuations: Characterizations

We consider the fair allocation of indivisible goods with binary valuations. In this setting, the maximum Nash welfare rule, the leximin rule, and all additive welfarist rules with a strictly concave function coincide. We show that for any number of agents, this rule is the only rule that satisfies envy-freeness up to one good, strategyproofness, neutrality, minimal completeness, and invariance under disapproving unassigned goods (IDU). Moreover, we present an alternative characterization for two agents, where we replace IDU with non-redundancy and resource-monotonicity. In both characterizations, all axioms are necessary.

econ.TH↗
arXiv2026

Ranking Experiments under Sequential Sampling

We rank experiments when a decision maker samples sequentially and chooses when to stop. We define two orders: large-budget dominance compares values in every decision problem once the expected-sample budget exceeds a common threshold; small-cost dominance compares values net of sampling costs when the cost per observation is sufficiently small in each problem. Generically, the orders coincide and are characterized by directed Kullback--Leibler (KL) dominance: larger KL divergence for every ordered pair of states. We also characterize the cost per copy of producing a specified experiment at scale by sampling a fixed source experiment. With a full-support prior, these cost functions are precisely sums of statewise maxima of positively weighted directed KL divergences. These costs are additive with two states but exhibit economies of scope with three or more states. Both results rest on an exact reproduction theorem: any experiment generated by sequentially sampling one source can be reproduced exactly by sampling another, with sharp first-order KL conversion rates and a square-root remainder whose coefficient depends only on the two sources.

econ.TH↗