Popular Matchings with Two-Sided Preferences and One-Sided Ties
From MaRDI portal
Publication:5371030
DOI10.1137/16M1076162zbMath1372.05168MaRDI QIDQ5371030
Telikepalli Kavitha, Ágnes Cseh, Chien-Chung Huang
Publication date: 24 October 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
Popular Branchings and Their Dual Certificates ⋮ Finding popular branchings in vertex-weighted digraphs ⋮ Popular critical matchings in the many-to-many setting ⋮ Finding popular branchings in vertex-weighted directed graphs ⋮ Minimal envy and popular matchings ⋮ Popular matchings with two-sided preference lists and matroid constraints ⋮ Understanding Popular Matchings via Stable Matchings ⋮ Popular branchings and their dual certificates
Cites Work
- Unnamed Item
- Popular mixed matchings
- Popular matchings: structure and algorithms
- Optimal popular matchings
- Popular matchings in the weighted capacitated house allocation problem
- Popular edges and dominant matchings
- Popular matchings in the stable marriage problem
- Popular and clan-popular \(b\)-matchings
- Coverings of Bipartite Graphs
- Popular Matchings with Two-Sided Preferences and One-Sided Ties
- Popular Matchings
- Popular Matchings in the Marriage and Roommates Problems
- Popularity, Mixed Matchings, and Self-duality
- Popular Half-Integral Matchings.
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
- Weighted popular matchings
This page was built for publication: Popular Matchings with Two-Sided Preferences and One-Sided Ties
