Equitable Stable Matchings in Quadratic Time

NeurIPS 2019 Nikolaos TziavelisIoannis GiannakopoulosKaterina DokaNectarios KozirisPanagiotis Karras

Can a stable matching that achieves high equity among the two sides of a market be reached in quadratic time? The Deferred Acceptance (DA) algorithm finds a stable matching that is biased in favor of one side; optimizing apt equity measures is strongly NP-hard... (read more)

PDF Abstract

Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.