2026-07-22T06:31:11Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:24763 2026-02-09T07:37:56Z ddc:004 open_access

Evaluating Fairness of Sequential Resource Allocation Policies: A Computational Study Hojny, Christopher Spieksma, Frits C.R. Wessel, Sten fairness resource allocation computational analysis In the sequential resource allocation problem there is a single divisible resource that is divided over a number of clients. Allocations are made in a predetermined order and only upon arrival at a client their demand for the resource is revealed; only the probability distribution of the demand of every client is known to the supplier. We consider this problem from a fairness perspective, where the aim is to balance allocations between individual clients. Several allocation policies have been proposed in the literature. In this work, we introduce a new, non-adaptive policy based on linear programming that can also incorporate group fairness. In addition, we provide an extensive computational study to compare allocation policies on several fairness measures. Using an optimized implementation of existing methods, we are able to evaluate significantly larger problem instances than those previously considered in the literature. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Christopher Hojny and Frits C.R. Spieksma and Sten Wessel 2025 Is Part Of OASIcs, Volume 137, 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2025.7 urn:nbn:de:0030-drops-247635 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2025.7 eng https://creativecommons.org/licenses/by/4.0/legalcode