scientific article; zbMATH DE number 7278091

DOI10.4230/LIPICS.FSTTCS.2017.19zbMath1491.68140arXiv1609.07531MaRDI QIDQ5136309

Telikepalli Kavitha, Florian Brandl

Publication date: 25 November 2020

Full work available at URL: https://arxiv.org/abs/1609.07531

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

zbMATH Keywords

bipartite graphsGale-Shapley algorithmlinear programming duality

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Matching models (91B68)

Related Items (5)

Two problems in max-size popular matchings ⋮ Minimal envy and popular matchings ⋮ Finding strongly popular \(b\)-matchings in bipartite graphs ⋮ Popular matchings with two-sided preference lists and matroid constraints ⋮ How Good Are Popular Matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The hospitals/residents problem with lower quotas
• Popular mixed matchings
• Some remarks on the stable matching problem
• Three remarks on the many-to-many stable matching problem
• Popular edges and dominant matchings
• Popular matchings in the stable marriage problem
• Popularity in the generalized hospital residents setting
• Socially Stable Matchings in the Hospitals/Residents Problem
• Stability and Polarization of Interests in Job Matching
• Popular Matchings with Two-Sided Preferences and One-Sided Ties
• Popular Matchings
• Popular Matchings in the Marriage and Roommates Problems
• The Lattice Structure of the Set of Stable Matchings with Multiple Partners
• Popularity, Mixed Matchings, and Self-duality
• Popular Half-Integral Matchings.
• Algorithmics of Matching Under Preferences
• A Size-Popularity Tradeoff in the Stable Marriage Problem
• College Admissions and the Stability of Marriage

This page was built for publication: