On efficiency and the Jain’s fairness index in integer assignment problems

Abstract

Abstract Given two sets of objects, the integer assignment problem consists of assigning objects of one set to objects in the other set. Traditionally, the goal of this problem is to find an assignment that minimizes or maximizes a measure of efficiency, such as maximization of utility or minimization of cost. Lately, the interest in incorporating a measure of fairness in addition to efficiency has gained importance. This paper studies how to incorporate these two criteria in an integer assignment, using the Jain’s index as a measure of fairness. The original formulation of the assignment problem with this index involves a non-concave function, which renders a non-linear non-convex problem, usually hard to solve. To this aim, we develop two reformulations, where one is based on a quadratic objective function and the other one is based on integer second-order cone programming. We explore the performance of these reformulations in instances of real-world data derived from an application of assigning personnel to projects, and also in instances of randomly generated data. In terms of solution quality, all formulations prove to be effective in finding solutions capturing both efficiency and fairness criteria, with some slight differences depending on the type of instance. In terms of solving time, however, the performances of the formulations differ considerably. In particular, the integer quadratic approach proves to be much faster in finding optimal solutions.