Pith. sign in

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 1

years

2026 1

verdicts

ACCEPT 1

representative citing papers

Stable Matchings with Minimum Utility Gap

cs.GT · 2026-07-08 · accept · novelty 6.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Stable Matchings with Minimum Utility Gap cs.GT · 2026-07-08 · accept · none · ref 8

    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.