Pareto Optimal Matchings in Many-to-Many Markets with Ties

DOI10.1007/978-3-662-48433-3_3zbMath1358.91076arXiv1507.02866OpenAlexW2732258362MaRDI QIDQ3449579

Ioannis Mourtos, Pavlos Eirinakis, Eva Oceľáková, Tamás Fleiner, Dimitrios Magos, Katarína Cechlárova, Baharak Rastegari, David F. Manlove

Publication date: 4 November 2015

Published in: Algorithmic Game Theory (Search for Journal in Brave)

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

zbMATH Keywords

Pareto optimalitymany-to-many matchingserial dictatorshiptruthfulness

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Matching models (91B68)

Related Items (3)

Pareto optimal matchings in many-to-many markets with ties ⋮ Matching with indifferences: a comparison of algorithms in the context of course allocation ⋮ Efficient reallocation under additive and responsive preferences

Cites Work

• Unnamed Item
• Pareto optimal matchings in many-to-many markets with ties
• Queue allocation of indivisible goods
• Strategy-proofness, solidarity, and consistency for multiple assignment problems
• Pareto optimality in many-to-many matching problems
• Pareto optimality in coalition formation
• The Impossibility of Bayesian Group Decision Making with Separate Aggregation of Beliefs and Values
• Assignment Problem Based on Ordinal Preferences
• Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
• A Complexity Approach for Core-Selecting Exchange under Conditionally Lexicographic Preferences
• Algorithmics of Matching Under Preferences
• Random Matching Under Dichotomous Preferences
• Algorithms and Computation
• A new solution to the random assignment problem.

This page was built for publication: Pareto Optimal Matchings in Many-to-Many Markets with Ties