scientific article; zbMATH DE number 7278072

DOI10.4230/LIPIcs.ISAAC.2017.67zbMath1457.91275MaRDI QIDQ5136288

Yu Yokoi

Publication date: 25 November 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial-time algorithmstable matchingslower quotasenvy-free matchingsparamodular functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Matching models (91B68)

Related Items (2)

Popular Matchings with Lower Quotas ⋮ How Good Are Popular Matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The hospitals/residents problem with lower 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
• Stable marriage with covering constraints -- a complete computational trichotomy
• The college admissions problem with lower and common quotas
• A strongly polynomial minimum cost circulation algorithm
• Some remarks on the stable matching problem
• Generalized polymatroids and submodular flows
• Matchings with lower quotas: algorithms and complexity
• A Matroid Approach to Stable Matchings with Lower Quotas
• A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas
• Stability and Polarization of Interests in Job Matching
• The Hospitals/Residents Problem with Quota Lower Bounds
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Algorithmics of Matching Under Preferences
• A Fixed-Point Approach to Stable Matchings and Some Applications
• College Admissions and the Stability of Marriage

This page was built for publication: