Popular Matchings in Complete Graphs
From MaRDI portal
Publication:5090952
Recommendations
- Popular matchings in complete graphs
- Popular matchings with ties and matroid constraints
- On matchings in graphs
- Popular matchings and limits to tractability
- Popular matchings: structure and algorithms
- Popular Matchings: Structure and Algorithms
- Exact perfect matching in complete graphs
- Finding strongly popular \(b\)-matchings in bipartite graphs
Cites work
- A New Approach to Stable Matching Problems
- A Size-Popularity Tradeoff in the Stable Marriage Problem
- A necessary and sufficient condition for the existence of a complete stable matching
- Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
- An efficient algorithm for the “stable roommates” problem
- College Admissions and the Stability of Marriage
- Core stability in hedonic coalition formation
- Near-popular matchings in the roommates problem
- On the existence of stable roommate matchings
- Popular Half-Integral Matchings.
- Popular Mixed Matchings
- Popular matchings in the marriage and roommates problems
- Popular matchings in the stable marriage problem
- Popular matchings of desired size
- Popularity, mixed matchings, and self-duality
- The complexity of satisfiability problems
- The geometry of fractional stable matchings and its applications
- Three-sided stable matchings with cyclic preferences
Cited in
(5)
This page was built for publication: Popular Matchings in Complete Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090952)
