Adaptive Multi-Round Allocation with Stochastic Arrivals

📰 ArXiv cs.AI

arXiv:2605.12111v1 Announce Type: new Abstract: We study a sequential resource allocation problem motivated by adaptive network recruitment, in which a limited budget of identical resources must be allocated over multiple rounds to individuals with stochastic referral capacity. Successful referrals endogenously generate future decision opportunities while allocating additional resources to an individual exhibits diminishing returns. We first show that the single-round allocation problem admits a

Published 13 May 2026
Read full paper → ← Back to Reads