The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases
From MaRDI portal
Publication:1755782
DOI10.1007/s00453-018-0434-5zbMath1412.90077OpenAlexW2794791586MaRDI QIDQ1755782
Patrice Perny, Julien Lesca, Michel Minoux
Publication date: 11 January 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://basepub.dauphine.fr/handle/123456789/18625
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Optimizing a generalized Gini index in stable marriage problems: NP-hardness, approximation and a polynomial time special case ⋮ Minimizing and balancing envy among agents using ordered weighted average
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fair assignment of indivisible objects under ordinal preferences
- k-sum optimization problems
- On \(k\)-Max-optimization
- Minimum deviation problems
- Generalized Gini inequality indices
- Lexicographic bottleneck combinatorial problems
- Compact versus noncompact LP formulations for minimizing convex Choquet integrals
- On solving linear programs with the ordered weighted averaging objective.
- Solving combinatorial problems with combined min-max-min-sum objective and applications
- Algorithmic results for ordered median problems
- Assigning papers to referees
- Fair optimization and networks: a survey
- Alternative formulations for the ordered weighted averaging objective
- Worst case compromises in matroids with applications to the allocation of indivisible goods
- Exact procedures for solving the discrete ordered median problem
- LP Solvable Models for Multiagent Fair Allocation problems
- The weighted OWA operator
- Fairness and Rank-Weighted Utilitarianism in Resource Allocation
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- An Induction Theorem for Rearrangements
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Integral Representation Without Additivity
- Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
- The complexity of theorem-proving procedures
- Inequalities: theory of majorization and its applications
