Popular critical matchings in the many-to-many setting
From MaRDI portal
Publication:6199405
DOI10.1016/j.tcs.2023.114281arXiv2206.12394OpenAlexW4388461574MaRDI QIDQ6199405
Unnamed Author, Keshav Ranjan, Prajakta Nimbhorkar, Meghana Nasre
Publication date: 23 February 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.12394
Cites Work
- Unnamed Item
- The hospitals/residents problem with lower quotas
- The lattice of envy-free matchings
- Popular edges and dominant matchings
- Simple push-relabel algorithms for matroids and submodular flows
- Popular matchings in the stable marriage problem
- Envy-free matchings with lower quotas
- Many-to-one popular matchings with two-sided preferences and one-sided ties
- Stable matchings with covering constraints: a complete computational trichotomy
- Pareto optimality in many-to-many matching problems
- Popularity in the generalized hospital residents setting
- Two problems in max-size popular matchings
- A Matroid Approach to Stable Matchings with Lower Quotas
- Stability and Polarization of Interests in Job Matching
- Popular Matchings
- Popular Matchings in the Marriage and Roommates Problems
- Strongly Stable Assignment
- A new approach to the maximum-flow problem
- Popularity, Mixed Matchings, and Self-Duality
- Understanding Popular Matchings via Stable Matchings
- Popular Branchings and Their Dual Certificates
- Quasi-popular Matchings, Optimality, and Extended Formulations
- Popular Matchings with Two-Sided Preferences and One-Sided Ties
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- College Admissions and the Stability of Marriage
- Envy-freeness and relaxed stability: hardness and approximation algorithms
- Incomplete list setting of the hospitals/residents problem with maximally satisfying lower quotas
This page was built for publication: Popular critical matchings in the many-to-many setting
