Fair Stable Matchings Under Correlated Preferences (Student Abstract)

Authors

  • Angelina Brilliantova Rochester Institute of Technology, Rochester, NY, USA
  • Hadi Hosseini The Pennsylvania State University, University Park, PA, USA

DOI:

https://doi.org/10.1609/aaai.v35i18.17878

Keywords:

Stable Matchings, Fairness, Multiagent Systems

Abstract

Stable matching models are widely used in market design, school admission, and donor organ exchange. The classic Deferred Acceptance (DA) algorithm guarantees a stable matching that is optimal for one side (say men) and pessimal for the other (say women). A sex-equal stable matching aims at providing a fair solution to this problem. We demonstrate that under a class of correlated preferences, the DA algorithm either returns a sex-equal solution or has a very low sex-equality cost.
AAAI-21 Proceedings Cover

Downloads

Published

2021-05-18

How to Cite

Brilliantova, A., & Hosseini, H. (2021). Fair Stable Matchings Under Correlated Preferences (Student Abstract). Proceedings of the AAAI Conference on Artificial Intelligence, 35(18), 15763-15764. https://doi.org/10.1609/aaai.v35i18.17878

Issue

Vol. 35 No. 18: AAAI-21 Student Papers and Demonstrations

Section

AAAI Student Abstract and Poster Program