Full-class non-tightness at every finite degree
Prove that the rank-dependent primal–dual protocol is not tight at every finite degree d≥2, even when optimized over the full admissible class of measurable nonnegative rank-only gain-sharing functions; specifically, establish Γ_A(d)<γ(d) for online-degree-bounded instances and \tilde{Γ}_A(d)<\tilde{γ}(d) for d-regular instances.
References
Our degree-two results motivate the conjecture that the rank-dependent protocol is not tight at any finite degree $d\geq2$, even over the full admissible class:
\Gamma_{\cA}(d)<\gamma(d),\qquad \tilde\Gamma_{\cA}(d)<\tilde\gamma(d) \qquad\text{for every integer }d\text{ with }2\leq d<\infty.
For fixed $\mathfrak P$, $\cS$, and \rank{}, can tightness be characterized through structural properties of the instance class $\cG$?