3 problems

Let the objective functions be general submodular functions and let the feasible sets be subject to general matroid constraints in the bandit setting. Wan et al.'s impossibility co…

Sharpness conjecture. The latter bound is sharp, i.e.

Hamming-distance-one conjecture. An analogous combinatorial property to Lemma might allow this feasible set to be shrunk from $\mathrm{Alt}(c^{t*})$ to the alternative instances wh…