Methods & evidenceMaintain non-zero minimum treatment assignment probabilities ($\gamma > 0$) in adaptive algorithms to secure $O(1/\sqrt{T})$ worst-case regret bounds against non-stationary shocks during field deployment.Proves that algorithms like the Tempered Thompson Algorithm achieve worst-case average regret on the order of $O(1/\sqrt{T})$ (up to logarithmic terms) relative to any fixed targeted assignment policy, guaranteeing robust participant welfare even under non-stationary outcome distributions.
RCT