Improving on a Lottery: Efficient Estimation of Optimal Assignment Rules
改进抽签分配:最优分配规则的有效估计
Scarce opportunities are often allocated by lotteries. We study how to improve such allocations by estimating optimal assignment rules that maximize welfare net of a Kullback--Leibler penalty for departing from the benchmark randomization. The framework covers discrete, continuous, and mixed treatments. Regret is asymptotically quadratic in the estimation error, so inefficient estimation raises the mean of limiting regret, not merely its dispersion. We show that inverse…