Pareto optimality in many-to-many matching problems
From MaRDI portal
Publication:2339842
DOI10.1016/j.disopt.2014.09.002zbMath1308.91117OpenAlexW2028349730MaRDI QIDQ2339842
Eva Potpinková, Dimitrios Magos, Pavlos Eirinakis, Ioannis Mourtos, Tamás Fleiner, Katarína Cechlárova
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
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Cooperative games (91A12) (n)-person games, (n>2) (91A06) Matching models (91B68)
Related Items (10)
Pareto Optimal Matchings in Many-to-Many Markets with Ties ⋮ The Complexity of Computing the Random Priority Allocation Matrix ⋮ Pareto optimal matchings of students to courses in the presence of prerequisites ⋮ Pareto optimal matchings with lower quotas ⋮ Serial dictatorship vs. Nash in assessing Pareto optimality in many-to-many matchings with an application in water management ⋮ Popular critical matchings in the many-to-many setting ⋮ Pareto optimal matchings in many-to-many markets with ties ⋮ Counting houses of Pareto optimal matchings in the house allocation problem ⋮ Size versus truthfulness in the house allocation problem ⋮ Serial rules in a multi-unit Shapley-Scarf market
Cites Work
- Unnamed Item
- Unnamed Item
- A tale of two mechanisms: Student placement
- House allocation with existing tenants
- A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- Algorithmics of Matching Under Preferences
- Algorithms and Computation
This page was built for publication: Pareto optimality in many-to-many matching problems
