Generative Frontier Planning for Adaptive Peer-Referral Recruitment under Covariate-Dependent Arrivals
Published in KDD 2026 Workshop on epiDAMIK, 2026
This paper studies adaptive peer-referral recruitment, where limited referral resources must be allocated across multiple rounds and current decisions affect both the number and covariates of future recruits. We propose Generative Frontier Planning, a model-based planner that learns covariate-dependent referral dynamics and uses a latent coverage value surrogate to make future-frontier planning tractable. By replacing per-step Monte Carlo sampling with deterministic backups and exploiting diminishing returns for greedy allocation, our method improves recruitment performance over random, reinforcement-learning, and population-level dynamic-programming baselines.
Recommended citation: Kong, L.*, Jiang, H.*, Ma, A., Wang, K., Kangaslahti, A., & Tambe, M. Generative Frontier Planning for Adaptive Peer-Referral Recruitment under Covariate-Dependent Arrivals. KDD 2026 Workshop epiDAMIK. (*Equal contribution)
Download Paper
