Popular Matchings
From MaRDI portal
Publication:3519386
DOI10.1137/06067328XzbMath1154.91033OpenAlexW2914186512MaRDI QIDQ3519386
Robert W. Irving, David J. Abraham, Telikepalli Kavitha, Kurt Mehlhorn
Publication date: 14 August 2008
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/06067328x
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)
Related Items (53)
Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms ⋮ Popular Branchings and Their Dual Certificates ⋮ Popular Matchings with Two-Sided Preferences and One-Sided Ties ⋮ Maintaining Near-Popular Matchings ⋮ Popular Matchings with Two-Sided Preferences and One-Sided Ties ⋮ Finding popular branchings in vertex-weighted digraphs ⋮ The popular matching and condensation problems under matroid constraints ⋮ Quasi-Popular Matchings, Optimality, and Extended Formulations ⋮ Popularity in the generalized hospital residents setting ⋮ Popular Matchings: Structure and Algorithms ⋮ The Generalized Popular Condensation Problem ⋮ Finding and Recognizing Popular Coalition Structures ⋮ Two problems in max-size popular matchings ⋮ Dynamic rank-maximal and popular matchings ⋮ Popular Matchings with Ties and Matroid Constraints ⋮ The dynamics of rank-maximal and popular matchings ⋮ On weakly and strongly popular rankings ⋮ Bounded Unpopularity Matchings ⋮ Popular matchings with variable item copies ⋮ Popular critical matchings in the many-to-many setting ⋮ Finding popular branchings in vertex-weighted directed graphs ⋮ Locally Stable Marriage with Strict Preferences ⋮ Donation center location problem ⋮ Bounded unpopularity matchings ⋮ Popular matchings: structure and algorithms ⋮ Popular ranking ⋮ Rank-maximal matchings -- structure and algorithms ⋮ Tradeoffs between information and ordinal approximation for bipartite matching ⋮ Maximum locally stable matchings ⋮ The envy-free matching problem with pairwise preferences ⋮ Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version) ⋮ Minimal envy and popular matchings ⋮ Popular Matchings in the Stable Marriage Problem ⋮ Matching with indifferences: a comparison of algorithms in the context of course allocation ⋮ Popular and clan-popular \(b\)-matchings ⋮ Optimal popular matchings ⋮ Popular mixed matchings ⋮ Popular matchings in the weighted capacitated house allocation problem ⋮ Popularity at minimum cost ⋮ Finding strongly popular \(b\)-matchings in bipartite graphs ⋮ Temporal matching ⋮ Popular matchings with two-sided preference lists and matroid constraints ⋮ Social Welfare in One-Sided Matching Markets without Money ⋮ Envy-free matchings with one-sided preferences and matroid constraints ⋮ Unnamed Item ⋮ Weighted popular matchings ⋮ Popularity, Mixed Matchings, and Self-Duality ⋮ Fully Dynamic Maximal Matching in $O(\log n)$ Update Time ⋮ Strategy-proof popular mechanisms ⋮ Unnamed Item ⋮ How Good Are Popular Matchings ⋮ Understanding Popular Matchings via Stable Matchings ⋮ Popular branchings and their dual certificates
This page was built for publication: Popular Matchings
