惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

量子位
雷峰网
雷峰网
博客园 - 三生石上(FineUI控件)
月光博客
月光博客
有赞技术团队
有赞技术团队
阮一峰的网络日志
阮一峰的网络日志
Last Week in AI
Last Week in AI
G
Google Developers Blog
腾讯CDC
B
Blog
Microsoft Azure Blog
Microsoft Azure Blog
酷 壳 – CoolShell
酷 壳 – CoolShell
Microsoft Security Blog
Microsoft Security Blog
人人都是产品经理
人人都是产品经理
博客园_首页
T
Tailwind CSS Blog
C
Check Point Blog
博客园 - 【当耐特】
MongoDB | Blog
MongoDB | Blog
A
About on SuperTechFans
Y
Y Combinator Blog
L
LangChain Blog
Engineering at Meta
Engineering at Meta
GbyAI
GbyAI

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Public Good Provision under Locally Private Signals
[Submitted on 22 Jun 2026] · 2026-06-24 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:We study public-good provision when a planner observes agents' preferences only through a fixed local-privacy channel that randomizes each report before it reaches the planner. We characterize the optimal reduced-form allocation: the project is implemented when an aggregate posterior score is positive, where each agent's score combines the posterior expected valuation and posterior virtual value. Privacy enters through these posterior objects, muting the responsiveness of provision to private preferences and, under weak monotone likelihood ratios, potentially generating pooling. We then distinguish the optimal reduced-form allocation from its implementation through signal-measurable transfers: the required transfers solve a Fredholm integral equation whose solution is unique under completeness when it exists, while existence requires a separate range condition. Maximum reduced-form revenue exhibits three population regimes: it is asymptotically linear, of square-root order, or exponentially small according as the lower endpoint of the valuation distribution is positive, zero, or negative. Finally, welfare comparisons depend on the privacy calibration. At a common noise scale, Laplace Blackwell-dominates logistic noise, while under a common tight $\mu$-GDP calibration the ordering reverses for the maximally separated binary endpoint experiment. Thus the preferred privacy channel depends on the standard used to hold privacy fixed.

Submission history

From: Behrooz Moosavi Ramezanzadeh [view email]
[v1] Mon, 22 Jun 2026 23:35:04 UTC (519 KB)