Searcharxiv⌕ Search

arXiv · 2610.41283

Truthful and Admissible Principal--Agent Testing with Nuisance Parameters

Abstract

Statistical contracts reward experimenters according to the evidence produced by a costly study, so the reward rule influences both who participates and what they report. Principal--agent testing theory explains how to prevent ineffective proposals from being profitable. We ask when such contracts can also elicit honest parameter reports if the decision concerns a mean effect but the variance or distributional shape is unknown. Under risk neutrality and a fixed participation cost, we construct menus of e-values --- nonnegative normalized rewards with expected value at most one under every null --- such that (i) agents who know they are null have no incentive to participate, (ii) every alternative type earns positive expected profit and is thus incentivized to participate, (iii) truthful reporting uniquely maximizes expected their reward, (iv) and each contract is admissible: its payouts cannot be pointwise improved while retaining null validity. For Gaussian observations, we treat separately agents who know both mean and variance and agents who know only their mean; in the latter case, truthfulness holds at every variance without requiring a nuisance prior. Multi-sample extensions preserve these incentives and can reward accumulating evidence. Beyond Gaussian models, we show that two independent nonnegative observations suffice to elicit any finite mean above a positive null threshold, without any further distributional knowledge, but one observation cannot combine strict mean elicitation with individual admissibility on this class. Finally, we distinguish the existence of useful tests from the identification needed for truthful contracts. Boundedness is not required, and finitely many null constraints do not by themselves guarantee admissible elicitation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aaditya Ramdas. 2026-10-30. Truthful and Admissible Principal--Agent Testing with Nuisance Parameters. https://arxiv.org/abs/2610.41283

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

KEEP EXPLORING

Related papers

Debiased Estimating Equation Method for Robust and Efficient Mendelian Randomization Using a Large Number of Correlated Weak and Invalid Instruments

Mendelian randomization (MR) is a widely used tool for causal inference in the presence of unmeasured confounders, which uses single nucleotide polymorphisms (SNPs) as instrumental variables to estimate causal effects. However, SNPs often have weak effects on complex traits, leading to bias in existing MR analyses when weak instruments are included. In addition, existing MR methods often restrict analysis to independent SNPs via linkage disequilibrium clumping and result in a loss of efficiency in estimating the causal effect due to discarding correlated SNPs. To address these issues, we propose the Debiased Estimating Equation Method (DEEM), a summary statistics-based MR approach that can incorporate a large number of correlated, weak-effect, and invalid SNPs. DEEM effectively eliminates the weak instrument bias and improves the statistical efficiency of the causal effect estimation by leveraging information from a large number of correlated SNPs. DEEM also allows for pleiotropic effects, adjusts for the winner's curse, and applies to both two-sample and one-sample MR analyses. Asymptotic analyses of the DEEM estimator demonstrate its attractive theoretical properties. Through extensive simulations and two real data examples, we demonstrate that DEEM significantly improves the efficiency and robustness of MR analysis compared with existing methods.

stat.ME↗

Latent Space Graph-fused LASSO for Clustering in Attributed Graphs

This manuscript studies latent space graph-fused LASSO methods for clustering graphs with multivariate nodal attributes. The framework includes node-specific priors of low-dimensional representations coupled with a neural decoder that bridges the observed attributes with the latent variables. Both structural and attribute information are incorporated for the clustering through a graph-fused LASSO regularization on prior nodal means. The optimization problem is solved via the alternating direction method of multipliers with Langevin dynamics for posterior inference. Simulations on grid and block graphs, together with applications to California county temperatures and Los Angeles traffic data, demonstrate the effectiveness of the proposed method.

stat.ME↗

Missing data and cluster graphs: cluster-level missingness vs variable-level missingness

Missing data is pervasive in many scientific domains such as public health, environmental science, and the social sciences. Recoverability from missing data is typically studied using fully specified variable-level missingness models despite that, in many applications, only coarse structural information is available, for instance when variables are grouped into clusters due to limited knowledge or interpretability reasons. In this paper, we investigate recoverability from such abstract representations. We introduce two classes of cluster-based missingness graphs: the m-C-DMG, which retains variable-specific missingness indicators, and the cm-C-DMG, which aggregates missingness mechanisms at the cluster level. We formalize the notion of compatibility between these abstract graphs and underlying variable-level missingness models, and study how this abstraction affects the recoverability of probabilistic and causal queries. In particular, we give graphical conditions of recovering the joint distribution as well as graphical conditions of recovering a macro causal effect.

stat.ME↗