Popularity, mixed matchings, and self-duality
DOI10.1137/1.9781611974782.151zbMATH Open1410.91354OpenAlexW4242625978MaRDI QIDQ4575899FDOQ4575899
Authors: Chien-Chung Huang, Telikepalli Kavitha
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611974782.151
Recommendations
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)
Cited In (10)
- Popular Matchings in Complete Graphs
- Finding and Recognizing Popular Coalition Structures
- Popular matchings with two-sided preferences and one-sided ties
- Popular branchings and their dual certificates
- Popular matchings with multiple partners
- Popularity, Mixed Matchings, and Self-Duality
- Finding strongly popular \(b\)-matchings in bipartite graphs
- Popular matchings in complete graphs
- Popular branchings and their dual certificates
- Two problems in max-size popular matchings
This page was built for publication: Popularity, mixed matchings, and self-duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575899)