Popular Matchings in the Stable Marriage Problem
From MaRDI portal
Publication:3012841
DOI10.1007/978-3-642-22006-7_56zbMath1334.05168MaRDI QIDQ3012841
Telikepalli Kavitha, Chien-Chung Huang
Publication date: 6 July 2011
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_56
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
91B68: Matching models
Related Items
Finding and Recognizing Popular Coalition Structures, Popular Matchings in Complete Graphs, Unnamed Item, Finding strongly popular \(b\)-matchings in bipartite graphs, It is difficult to tell if there is a Condorcet spanning tree, Popularity in the generalized hospital residents setting, Popular Matchings with Two-Sided Preferences and One-Sided Ties
Cites Work
- Unnamed Item
- Popular Matchings
- Popular Matchings in the Marriage and Roommates Problems
- Weighted Popular Matchings
- Popular Mixed Matchings
- Popular Matchings in the Capacitated House Allocation Problem
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
- College Admissions and the Stability of Marriage