Pages that link to "Item:Q2339842"
From MaRDI portal
The following pages link to Pareto optimality in many-to-many matching problems (Q2339842):
Displaying 14 items.
- Pareto optimal matchings in many-to-many markets with ties (Q506537) (← links)
- Counting houses of Pareto optimal matchings in the house allocation problem (Q738845) (← links)
- Pareto optimal matchings of students to courses in the presence of prerequisites (Q1662656) (← links)
- Serial rules in a multi-unit Shapley-Scarf market (Q2100651) (← links)
- Size versus truthfulness in the house allocation problem (Q2319628) (← links)
- Pareto optimal matchings with lower quotas (Q2409711) (← links)
- Pareto Optimal Matchings in Many-to-Many Markets with Ties (Q3449579) (← links)
- The Complexity of Computing the Random Priority Allocation Matrix (Q3465944) (← links)
- Serial dictatorship vs. Nash in assessing Pareto optimality in many-to-many matchings with an application in water management (Q6107330) (← links)
- Popular critical matchings in the many-to-many setting (Q6199405) (← links)
- Computational complexity of \(k\)-stable matchings (Q6546302) (← links)
- On Pareto optimal balanced exchanges (Q6564189) (← links)
- Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains (Q6565042) (← links)
- Solving the maximum popular matching problem with matroid constraints (Q6581613) (← links)
