Pareto optimal matchings in many-to-many markets with ties
From MaRDI portal
Publication:506537
DOI10.1007/s00224-016-9677-1zbMath1356.91071OpenAlexW1710593800WikidataQ59474046 ScholiaQ59474046MaRDI QIDQ506537
Pavlos Eirinakis, Eva Oceľáková, Ioannis Mourtos, Baharak Rastegari, Tamás Fleiner, Dimitrios Magos, David F. Manlove, Katarína Cechlárova
Publication date: 1 February 2017
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-016-9677-1
Related Items
Pareto Optimal Matchings in Many-to-Many Markets with Ties, Pareto optimal matchings of students to courses in the presence of prerequisites, Pareto optimal matchings with lower quotas, Efficient reallocation under additive and responsive preferences, Complexity of finding Pareto-efficient allocations of highest welfare
Cites Work
- Unnamed Item
- Negative-cycle detection algorithms
- Queue allocation of indivisible goods
- Strategy-proofness, solidarity, and consistency for multiple assignment problems
- On a conjecture by Gale about one-sided matching problems
- Size versus truthfulness in the house allocation problem
- Pareto optimality in many-to-many matching problems
- Pareto Optimal Matchings in Many-to-Many Markets with Ties
- 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.
