Both the difference and ratio versions of minimizing the utility gap across agents in a many-to-many stable matching are solvable in O(n⁴ + n²T_v) time via rotation-poset chain structure and sliding-window feasibility testing.
Title resolution pending
1 Pith paper cite this work, alongside 68 external citations. Polarity classification is still indexing.
1
Pith paper citing it
68
external citations · OpenAlex
fields
cs.GT 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Stable Matchings with Minimum Utility Gap
Both the difference and ratio versions of minimizing the utility gap across agents in a many-to-many stable matching are solvable in O(n⁴ + n²T_v) time via rotation-poset chain structure and sliding-window feasibility testing.