Equitable Stable Matchings in Quadratic Time
Nikolaos Tziavelis, Ioannis Giannakopoulos, Katerina Doka, Nectarios Koziris, Panagiotis Karras
–Neural Information Processing Systems
Can we reach a stable matching that achieves high equity among the two sides of a market 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. A proposed approximation algorithm offers a guarantee only with respect to the DA solutions.
Neural Information Processing Systems
Jan-27-2025, 01:49:30 GMT
- Country:
- Europe (1.00)
- North America > Canada (0.28)
- Genre:
- Research Report > New Finding (0.68)
- Industry:
- Education > Educational Setting (0.93)
- Technology: