Towards Efficient Pareto-optimal Utility-Fairness between Groups in Repeated Rankings

arXiv:2402.14305v1 Announce Type: cross
Abstract: In this paper, we tackle the problem of computing a sequence of rankings with the guarantee of the Pareto-optimal balance between (1) maximizing the utility of the consumers and (2) minimizing unfairness between producers of the items. Such a multi-objective optimization problem is typically solved using a combination of a scalarization method and linear programming on bi-stochastic matrices, representing the distribution of possible rankings of items. However, the above-mentioned approach relies on Birkhoff-von Neumann (BvN) …

abstract arxiv balance computing consumers cs.ir cs.lg fairness multi-objective optimization paper pareto rankings type utility