Document Open Access Logo

Evaluating Fairness of Sequential Resource Allocation Policies: A Computational Study

Authors Christopher Hojny , Frits C.R. Spieksma , Sten Wessel

PDF

File

Thumbnail PDF
PDF
OASIcs.ATMOS.2025.7.pdf
  • Filesize: 0.67 MB
  • 14 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Applied computing → Operations research
Keywords
  • fairness
  • resource allocation
  • computational analysis

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

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.

Cite As Get BibTex

Christopher Hojny, Frits C.R. Spieksma, and Sten Wessel. Evaluating Fairness of Sequential Resource Allocation Policies: A Computational Study. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 7:1-7:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/OASIcs.ATMOS.2025.7

Author Details

Christopher Hojny
  • Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands
Frits C.R. Spieksma
  • Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands
Sten Wessel
  • Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands

Funding

This research is supported by NWO Gravitation Project NETWORKS, The Netherlands, Grant Number 024.002.003.

Supplementary Materials

References

  1. Yehuda Bassok and Ricardo Ernst. Dynamic allocations for multi-product distribution. Transportation Science, 29(3):256-266, 1995. URL: https://doi.org/10.1287/trsc.29.3.256.
  2. Robert W. Lien, Seyed M. R. Iravani, and Karen R. Smilowitz. Sequential resource allocation for nonprofit operations. Operations Research, 62(2):301-317, 2014. URL: https://doi.org/10.1287/opre.2013.1244.
  3. Vahideh Manshadi, Rad Niazadeh, and Scott Rodilitz. Fair dynamic rationing. Management Science, 69(11):6818-6836, 2023. URL: https://doi.org/10.1287/mnsc.2023.4700.
  4. Sean R. Sinclair, Gauri Jain, Siddhartha Banerjee, and Christina Lee Yu. Sequential fair allocation of limited resources under stochastic demands. Preprint, 2022. URL: https://arxiv.org/abs/2011.14382.
  5. N Sluijk, W Rei, J Kinable, M Gendreau, and T Van Woensel. Fair stochastic vehicle routing with partial deliveries. Preprint, 2023. URL: https://optimization-online.org/?p=22778.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact