Corpus ID: 210942692

Algorithms for new types of fair stable matchings

@article{Cooper2020AlgorithmsFN,
  title={Algorithms for new types of fair stable matchings},
  author={Frances Cooper and David Manlove},
  journal={ArXiv},
  year={2020},
  volume={abs/2001.10875}
}
  • Frances Cooper, David Manlove
  • Published in ArXiv 2020
  • Mathematics, Computer Science
  • We study the problem of finding "fair" stable matchings in the Stable Marriage problem with Incomplete lists (SMI). For an instance $I$ of SMI there may be many stable matchings, providing significantly different outcomes for the sets of men and women. We introduce two new notions of fairness in SMI. Firstly, a regret-equal stable matching minimises the difference in ranks of a worst-off man and a worst-off woman, among all stable matchings. Secondly, a min-regret sum stable matching minimises… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv