A PTAS for Non-Adaptive Stochastic Top-$k$ Sum under General Combinatorial Constraints
We study non-adaptive selection of a feasible set $S$ that maximizes the expected sum of the $k$ largest realized values among independent nonnegative discrete random variables. The same objective arises in team hiring and as VCG welfare in an $\ell$-unit auction. The main setting is a fixed-dimensional nonnegative pac...