scientific article; zbMATH DE number 7278072
From MaRDI portal
Publication:5136288
DOI10.4230/LIPICS.ISAAC.2017.67zbMATH Open1457.91275MaRDI QIDQ5136288FDOQ5136288
Authors: Yu Yokoi 
Publication date: 25 November 2020
Title of this publication is not available (Why is that?)
Recommendations
- Envy-free matchings with lower quotas
- On envy-free perfect matching
- Matchings with lower quotas: algorithms and complexity
- The envy-free matching problem with pairwise preferences
- Pareto optimal matchings with lower quotas
- Envy-freeness and relaxed stability for lower-quotas: a parameterized perspective
- The lattice of envy-free matchings
- Envy-free matchings with one-sided preferences and matroid constraints
- Random matching under priorities: stability and no envy concepts
- A matroid approach to stable matchings with lower quotas
Cites Work
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Some remarks on the stable matching problem
- The hospitals/residents problem with lower quotas
- Connections in combinatorial optimization
- The Hospitals/Residents Problem with Quota Lower Bounds
- Title not available (Why is that?)
- Title not available (Why is that?)
- College Admissions and the Stability of Marriage
- The college admissions problem with lower and common quotas
- Strategyproof matching with regional minimum and maximum quotas
- School choice with controlled choice constraints: hard bounds versus soft bounds
- Stability concepts in matching under distributional constraints
- A Fixed-Point Approach to Stable Matchings and Some Applications
- Stability and Polarization of Interests in Job Matching
- A strongly polynomial minimum cost circulation algorithm
- Generalized polymatroids and submodular flows
- Algorithmics of Matching Under Preferences
- Title not available (Why is that?)
- A matroid approach to stable matchings with lower quotas
- Title not available (Why is that?)
- Stable marriage with covering constraints -- a complete computational trichotomy
- Title not available (Why is that?)
- Matchings with lower quotas: algorithms and complexity
- A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas
Cited In (6)
- Envy-freeness and relaxed stability for lower-quotas: a parameterized perspective
- How Good Are Popular Matchings
- Envy-freeness and relaxed stability: hardness and approximation algorithms
- Envy-freeness and relaxed stability: hardness and approximation algorithms
- Incomplete list setting of the hospitals/residents problem with maximally satisfying lower quotas
- Popular Matchings with Lower Quotas
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136288)
