An efficient primal-dual algorithm for fair combinatorial optimization problems

DOI10.1007/978-3-319-71150-8_28zbMATH Open1470.90105arXiv1801.07544OpenAlexW2770855527MaRDI QIDQ1699796FDOQ1699796

Authors: Viet Hung Nguyen, Paul Weng 

Publication date: 26 February 2018

Abstract: We consider a general class of combinatorial optimization problems including among others allocation, multiple knapsack, matching or travelling salesman problems. The standard version of those problems is the maximum weight optimization problem where a sum of values is optimized. However, the sum is not a good aggregation function when the fairness of the distribution of those values (corresponding for example to different agents' utilities or criteria) is important. In this paper, using the generalized Gini index (GGI), a well-known inequality measure, instead of the sum to model fairness, we formulate a new general problem, that we call fair combinatorial optimization. Although GGI is a non-linear aggregating function, a $0,1$-linear program (IP) can be formulated for finding a GGI-optimal solution by exploiting a linearization of GGI proposed by Ogryczak and Sliwinski. However, the time spent by commercial solvers (e.g., CPLEX, Gurobi...) for solving (IP) increases very quickly with instances' size and can reach hours even for relatively small-sized ones. As a faster alternative, we propose a heuristic for solving (IP) based on a primal-dual approach using Lagrangian decomposition. %We experimentally evaluate our methods against the exact solution of (IP) by CPLEX on several fair optimization problems related to matching to demonstrate the efficiency of our proposition. We demonstrate the efficiency of our method by evaluating it against the exact solution of (IP) by CPLEX on several fair optimization problems related to matching. The numerical results show that our method outputs in a very short time efficient solutions giving lower bounds that CPLEX may take several orders of magnitude longer to obtain. Moreover, for instances for which we know the optimal value, these solutions are quasi-optimal with optimality gap less than 0.3%.

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

Recommendations

• Equitable Cost Allocations via Primal–Dual-Type Algorithms
• An algorithm for the fair resource allocation problem with a submodular constraint
• Combinatorial algorithm for restricted max-min fair allocation
• Combinatorial Algorithm for Restricted Max-Min Fair Allocation
• Diverse fair allocations: complexity and algorithms
• Using \(\ell^p\)-norms for fairness in combinatorial optimisation
• An algorithm for identifying fair and optimal allocations
• An approximation algorithm for max-min fair allocation of indivisible goods
• On complete primitives for fairness
• Optimal fair computation

zbMATH Keywords

matchingsubgradient methodordered weighted averaginggeneralized Gini indexfair optimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Integer programming (90C10)

Cited In (3)

• Using \(\ell^p\)-norms for fairness in combinatorial optimisation
• On efficiency and the Jain's fairness index in integer assignment problems
• Equitable Cost Allocations via Primal–Dual-Type Algorithms

Uses Software

• CPLEX
• Gurobi
• LEMON

This page was built for publication: An efficient primal-dual algorithm for fair combinatorial optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1699796)