Popular Matchings with Two-Sided Preferences and One-Sided Ties

DOI10.1007/978-3-662-47672-7_30zbMath1440.05166arXiv1603.07168OpenAlexW2224086306MaRDI QIDQ3448799

Ágnes Cseh, Chien-Chung Huang, Telikepalli Kavitha

Publication date: 27 October 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.07168

Mathematics Subject Classification ID

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 Matchings with Two-Sided Preferences and One-Sided Ties ⋮ Finding and Recognizing Popular Coalition Structures ⋮ Two problems in max-size popular matchings ⋮ Finding strongly popular \(b\)-matchings in bipartite graphs ⋮ Finding strongly popular \(b\)-matchings in bipartite graphs ⋮ Popular edges and dominant matchings ⋮ Unnamed Item ⋮ Popularity, Mixed Matchings, and Self-Duality

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal popular matchings
• Popular Matchings in the Stable Marriage Problem
• Coverings of Bipartite Graphs
• Popular Matchings
• Popular Matchings in the Marriage and Roommates Problems
• Weighted Popular Matchings
• Popular Mixed Matchings
• Popular Matchings: Structure and Algorithms
• Popular Matchings in the Capacitated House Allocation Problem
• The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences

This page was built for publication: Popular Matchings with Two-Sided Preferences and One-Sided Ties