Online 2-stage stable matching
From MaRDI portal
Publication:6069183
DOI10.1016/j.dam.2023.09.009arXiv2207.02057MaRDI QIDQ6069183
Bruno Escoffier, Evripidis Bampis, Paul Youssef
Publication date: 13 November 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.02057
Cites Work
- Linear programming brings marital bliss
- On-line algorithms for weighted bipartite matching and stable marriages
- ``Almost-stable matchings in the hospitals/residents problem with couples
- Student admissions and faculty recruitment
- Online multistage subset maximization problems
- Gradual college admission
- Complexity study for the robust stable marriage problem
- Dynamic rank-maximal and popular matchings
- The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems
- Maintaining Near-Popular Matchings
- Stable Matching with Evolving Preferences
- Changing Bases: Multistage Optimization for Matroids and Matchings
- Stable marriage assignment for unequal sets
- Maximum Matching in the Online Batch-arrival Model
- College Admissions and the Stability of Marriage
This page was built for publication: Online 2-stage stable matching
