Popular mixed matchings
From MaRDI portal
Publication:541674
DOI10.1016/j.tcs.2010.03.028zbMath1220.68073OpenAlexW2096797149WikidataQ62045781 ScholiaQ62045781MaRDI QIDQ541674
Telikepalli Kavitha, Meghana Nasre, Julián Mestre
Publication date: 7 June 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.03.028
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (16)
Popular Branchings and Their Dual Certificates ⋮ Popular Matchings with Two-Sided Preferences and One-Sided Ties ⋮ Quasi-Popular Matchings, Optimality, and Extended Formulations ⋮ Popular matchings in complete graphs ⋮ Finding and Recognizing Popular Coalition Structures ⋮ Two problems in max-size popular matchings ⋮ Popular Matchings with Ties and Matroid Constraints ⋮ Welfare maximization entices participation ⋮ POPULAR SPANNING TREES ⋮ Minimal envy and popular matchings ⋮ Popularity at minimum cost ⋮ Unnamed Item ⋮ Popularity, Mixed Matchings, and Self-Duality ⋮ A pessimist's approach to one-sided matching ⋮ Understanding Popular Matchings via Stable Matchings ⋮ Popular branchings and their dual certificates
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A solution to the random assignment problem on the full preference domain
- A constructive proof of the ordinal efficiency welfare theorem
- Ordinal efficiency and dominated sets of assignments.
- On a conjecture by Gale about one-sided matching problems
- Bounded Unpopularity Matchings
- Popular Matchings
- Weighted Popular Matchings
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Popular Matchings in the Capacitated House Allocation Problem
- The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
- Random Matching Under Dichotomous Preferences
- A new solution to the random assignment problem.
This page was built for publication: Popular mixed matchings
