Skip to content

Waiting Buys Exactly Two Moments: Endogenous Identification in Prediction-Driven Allocation

Oct 2026 · 0 citations · 23 references
Computer Science

Abstract

A planner with a fixed budget of preventive help must decide whom to help and when. Waiting reveals risk but removes intervention opportunities as higher-risk individuals leave first. We characterize this tradeoff under repeated noisy signals and risk-dependent attrition: in the canonical model, a length-$\tau$ observation prefix identifies exactly the latent risk moments $m_j=\mathbb E[p^j]$ for $j=0,\ldots,2\tau-1$, buying two new moments per additional period. These identify average next-period attrition among survivors but need not identify allocation welfare or attrition among those prioritized for treatment. Our observationally equivalent constructions establish unavoidable timing regret at any sample size for a fixed observation length, while exact certificates determine whether all compatible populations share a unique optimal date. Matched experiments separate the effects of estimation, bootstrap averaging, and regret weighting. Longer observation often resolves timing ambiguity, but the optimal date may already have passed. In our experiments, bootstrap averaging and early stopping improve decisions, while regret weighting adds no improvement in pooled mean squared regret: better statistical fit need not yield better allocation welfare. The code and artifacts are available at https://github.com/KurbanIntelligenceLab/waiting-buys-two-moments.

View source

Similar papers

Preprint Sep 2026

Adapting Pairs Trading to Gambling Markets A Case Study of the U.S. Presidential Election

Pairs trading exploits mean reversion in the relationship between related assets. We adapt this idea to political betting markets by modelling the combined implied probability of the two major-party nominees with a latent Ornstein-Uhlenbeck process whose mean-reversion level varies over time and whose observations cont...

Hao-Yu Liu, L. Thomas, Benjamin R. Baer et al. · 0 citations
Open access Oct 2026

Estimation-Robust Minimum-Variance Portfolio Allocation Under Factor-Loading Uncertainty

We study sequential minimum-variance allocation when estimated market-factor loadings are uncertain. At each date, a horizon-one convex problem is solved using an ellipsoidal confidence region for the jointly estimated loading vector. The full loading covariance includes cross-asset residual dependence, and the uncerta...

L. Carvalho, J. M. Palma · 0 citations
Preprint Oct 2026

Designing Independent Variation: A Guided Iteration Methodology for Price Experiments in Short, Correlated Panels

Estimation error in short, correlated pricing panels is dominated by trajectory dispersion rather than sampling noise, creating an identification shortfall that only independently assigned variation can resolve. We propose a guided iteration methodology to decide how much variation to generate, where, and for how long:...

Pedro Cadahía · 0 citations
Preprint Nov 2026

Overcoming Demand Censoring through Randomization for Risk-Sensitive Newsvendor Learning

We study online newsvendor learning with bounded demand, censored observations, and convex nonlinear shortage costs. Because stockouts can conceal the shortage magnitudes needed by gradient-based algorithms, we use randomized ordering to construct unbiased subgradient estimates. We characterize admissible randomization...

Zheng-Chao Wang, Ho-Nguyen Nam · 0 citations
Preprint Sep 2026

Risk-Averse Welfare Maximization via Marginal Treatment Effects

This paper studies risk-averse treatment allocation when individuals self-select into treatment based on unobserved characteristics. We develop a framework that combines the marginal treatment effect approach to endogenous selection with a general class of coherent risk measures that capture distributional preferences...

Jarrod Burgh, Emerson Melo · 0 citations
#machine learning Preprint Oct 2026

The Price of Current-Effect Inference in Nonstationary Multi-Armed Bandits

Adaptive experiments use bandit algorithms to favor interventions with higher expected rewards. However, decision-makers also require reliable inference on current treatment effects: differences between intervention and reference-arm mean rewards at the present time, rather than historical averages. These objectives co...

Sharan Sahu, Martin T. Wells · 0 citations

Related blog posts

Microsoft Research Blog Nov 3, 2026

Learn the rules: The hacker mindset

Research Manager Mike Walker reflects on a career spanning hacker culture, cybersecurity, and AI, sharing lessons about trust, teamwork, leadership, and why solving difficult problems requires curiosity, judgment, agility—and an understanding of the rules. The post Learn the rules: The hacker mindset appeared first on Microsoft Research.

Google DeepMind Blog Nov 3, 2026

Agentic cheminformatics with Google Antigravity

Learn how Google Antigravity and our Cheminformatics Skills accelerate drug discovery workflows, search compounds, and propose novel rigidified macrocycles.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.