Strict separation between edge-weighted and vertex-weighted factor-revealing values
Determine whether the edge-weighted factor-revealing value is strictly smaller than the corresponding value obtained when complementary monotone gain-sharing rules and the vertex-weighted cutoff constraint are allowed; equivalently, prove or refute the conjectured strictness of the first inequality in the factor-revealing hierarchy.
References
We conjecture that the first inequality above is strict.
— Harmonic Ranking for Edge-Weighted Oblivious Matching
(2608.12176 - Peng et al., 12 Aug 2026) in Section 6, Discussion, paragraph “Edge-weighted versus vertex-weighted”
Does removing monotonicity change the order of either gap, or only its leading constant? In particular, does the $\Omega(1/d)$ lower bound for the regular gap over $\cF$ persist over $\cA$?
— Certifying Capacity and Gaps of the Rank-Dependent Gain-Sharing Framework for Ranking
(2610.17545 - Xu, 13 Oct 2026) in Section 7, Conclusion and Future Directions, subsection “Full-class gaps at every finite degree”