Complexity of finding Pareto-efficient allocations of highest welfare
From MaRDI portal
Publication:2030716
Recommendations
Cites work
- A branch-and-price algorithm for stable workforce assignments with hierarchical skills
- A Fixed-Point Approach to Stable Matchings and Some Applications
- A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion
- Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
- Algorithms and Computation
- Assigning papers to referees
- College Admissions and the Stability of Marriage
- Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation
- Equilibria of two-sided matching games with common preferences
- Hard variants of stable marriage.
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- scientific article; zbMATH DE number 3185418 (Why is no real title available?)
- Integer programming methods for special college admissions problems
- Kidney Exchange
- Matching couples with Scarf's algorithm
- Matching with indifferences: a comparison of algorithms in the context of course allocation
- On a generalization of the stable roommates problem
- On cores and indivisibility
- Pareto optimal matchings in many-to-many markets with ties
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- School choice: an experimental study
- Size versus stability in the marriage problem
- Some remarks on the stable matching problem
- Strategy-proofness in the large
- The complexity of computing the random priority allocation matrix
- The Core of an N Person Game
- Weak versus strong domination in a market with indivisible goods
Cited in
(13)- A pessimist's approach to one-sided matching
- Minimal envy and popular matchings
- Efficient reallocation under additive and responsive preferences
- New algorithm for checking Pareto optimality in bimatrix games
- scientific article; zbMATH DE number 4160481 (Why is no real title available?)
- Placement optimization in refugee resettlement
- Computing welfare-maximizing fair allocations of indivisible goods
- Optimization methods and algorithms
- Computational complexity of \(k\)-stable matchings
- On Pareto optimal balanced exchanges
- Pareto optimal matching with multilayer preferences: how hard can it be??
- Pareto optimal matching with multilayer preferences: how hard can it be?
- Pareto-optimal linear programming
This page was built for publication: Complexity of finding Pareto-efficient allocations of highest welfare
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2030716)
