Fairness over time in dynamic resource allocation with an application in healthcare

DOI10.1007/S10107-022-01904-6MaRDI QIDQ6120930zbMATH OpenOpenAlexFDO

Authors Andrea Lodi, Philippe Olivier, Gilles Pesant, Sriram Sankaranarayanan

Publication date 21 February 2024

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Mixed integer programming (90C11) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Abstract: Decision making problems are typically concerned with maximizing efficiency. In contrast, we address problems where there are multiple stakeholders and a centralized decision maker who is obliged to decide in a fair manner. Different decisions give different utility to each stakeholder. In cases where these decisions are made repeatedly, we provide efficient mathematical programming formulations to identify both the maximum fairness possible and the decisions that improve fairness over time, for reasonable metrics of fairness. We apply this framework to the problem of ambulance allocation, where decisions in consecutive rounds are constrained. With this additional complexity, we prove structural results on identifying fair feasible allocation policies and provide a hybrid algorithm with column generation and constraint programming-based solution techniques for this class of problems. Computational experiments show that our method can solve these problems orders of magnitude faster than a naive approach.

Recommendations

• Fair resource allocation: using welfare-based dominance constraints
• Combining leximax fairness and efficiency in a mathematical programming model
• Fairness criteria for allocating scarce resources
• Improving fairness in ambulance planning by time sharing
• Optimizing fairness over time with homogeneous workers (short paper)

Cites work

• A \texttt{cost-regular} based hybrid column generation approach
• A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
• Ambulance location and relocation models.
• An Algorithm for the Equipollent Resource Allocation Problem
• Canonical Cuts on the Unit Hypercube
• Fair Allocation of Indivisible Goods and Criteria of Justice
• Fair optimization and networks: a survey
• scientific article; zbMATH DE number 544186 (Why is no real title available?)
• Minimization of maximum absolute deviation in integers
• More on Min-Max Allocation
• On interval-subgradient and no-good cuts
• On Marginal Allocation in Single Constraint Min-Max Problems
• Symmetry in integer linear programming
• The Humanitarian pickup and distribution problem
• The optimum distribution of effort

Cited in

(3)

• Optimizing fairness over time with homogeneous workers (short paper)
• Fair integer programming under dichotomous and cardinal preferences
• Railway crew planning with fairness over time

This page was built for publication: Fairness over time in dynamic resource allocation with an application in healthcare

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