Pareto efficient matchings with pairwise preferences

DOI10.1016/j.tcs.2023.113707OpenAlexW4317933836MaRDI QIDQ2683505

Naoyuki Kamiyama

Publication date: 13 February 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113707

zbMATH Keywords

stable matchingintransitive preferencePareto efficient matching

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) Matching models (91B68)

Cites Work

• Stable marriage with general preferences
• The Pareto-stability concept is a natural solution concept for discrete matching markets with indifferences
• Group strategyproof Pareto-stable marriage with indifferences via the generalized assignment game
• Preference structures and their numerical representations
• Stable marriage and indifference
• Two-sided matching with indifferences
• Stable matchings in trees
• Pareto stability in two-sided many-to-many matching with weak preferences
• Pairwise Preferences in the Stable Marriage Problem
• Pareto Stable Matchings under One-Sided Matroid Constraints
• A New Approach to the Pareto Stable Matching Problem
• Algorithmics of Matching Under Preferences
• MANY-TO-MANY STABLE MATCHINGS WITH TIES IN TREES
• College Admissions and the Stability of Marriage

This page was built for publication: Pareto efficient matchings with pairwise preferences