ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2411.10284
6
0
v1v2v3 (latest)

Optimal Capacity Modification for Strongly Stable Matchings

15 November 2024
Keshav Ranjan
Meghana Nasre
Prajakta Nimbhorkar
ArXiv (abs)PDFHTML
Main:1 Pages
5 Figures
Appendix:32 Pages
Abstract

We consider the Hospital/Residents (HR) problem in the presence of ties in preference lists. Among the three notions of stability, viz. weak, strong, and super stability, we focus on the notion of strong stability. Strong stability has many desirable properties both theoretically and practically; however, its existence is not guaranteed.

View on arXiv
@article{ranjan2025_2411.10284,
  title={ Optimal Capacity Modification for Stable Matchings with Ties },
  author={ Keshav Ranjan and Meghana Nasre and Prajakta Nimbhorkar },
  journal={arXiv preprint arXiv:2411.10284},
  year={ 2025 }
}
Comments on this paper