Pareto optimality in many-to-many matching problems

DOI10.1016/J.DISOPT.2014.09.002MaRDI QIDQ2339842zbMATH OpenOpenAlexFDO

Authors Pavlos Eirinakis, Tamás Fleiner, Dimitrios Magos, Ioannis Mourtos, Eva Potpinková, Katarina Cechlárová

Publication date 9 April 2015

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2014.09.002

zbMATH Keywords

matchingNP-completenessPareto optimalityserial dictatorship

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Abstract computational complexity for mathematical programming problems (90C60) (n)-person games, (n>2) (91A06) Matching models (91B68)

Recommendations

• Pareto optimal matchings in many-to-many markets with ties
• Pareto optimal matchings in many-to-many markets with ties
• Pareto stable matchings under one-sided matroid constraints
• Pareto optimal matchings with lower quotas
• On computing Pareto stable assignments

Cites work

• scientific article; zbMATH DE number 48303 (Why is no real title available?)
• A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion
• A tale of two mechanisms: Student placement
• Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
• Algorithms and Computation
• House allocation with existing tenants
• Network flows. Theory, algorithms, and applications.
• Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems

Cited in

(20)

• Serial rules in a multi-unit Shapley-Scarf market
• On Pareto optimal balanced exchanges
• Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains
• Solving the maximum popular matching problem with matroid constraints
• Lazy Gale-Shapley for many-to-one matching with partial information
• Size versus truthfulness in the house allocation problem
• Counting houses of Pareto optimal matchings in the house allocation problem
• Pareto optimal matchings with lower quotas
• Pareto stable matchings under one-sided matroid constraints
• Popular critical matchings in the many-to-many setting
• Pareto optimal matching with multilayer preferences: how hard can it be??
• On the convergence of swap dynamics to Pareto-optimal matchings
• The complexity of computing the random priority allocation matrix
• A new approach to the Pareto stable matching problem
• Serial dictatorship vs. Nash in assessing Pareto optimality in many-to-many matchings with an application in water management
• Pareto optimal matchings in many-to-many markets with ties
• Pareto optimal matchings in many-to-many markets with ties
• Pareto optimal matchings of students to courses in the presence of prerequisites
• Algorithms and Computation
• Computational complexity of \(k\)-stable matchings

This page was built for publication: Pareto optimality in many-to-many matching problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339842)