Forward-backward Contention Resolution Schemes for Fair Rationing

TL;DR

This paper develops contention resolution schemes (CRS) for fair resource allocation with stochastic demands, providing new guarantees for rank-1 matroids and knapsack constraints, especially under two-order arrival models.

Contribution

It introduces the first two-order CRS guarantees for rank-1 matroids and knapsack, improving existing bounds and establishing tightness and upper bounds for these models.

Findings

Two-order CRS for rank-1 matroids with guarantee ~0.622, tight bound.

Two-order CRS for knapsack with guarantee 1/3, best-known offline guarantee.

Upper bound of ~0.422 for two-order knapsack CRS, below random-order bound.

Abstract

We use contention resolution schemes (CRS) to derive algorithms for the fair rationing of a single resource when agents have stochastic demands. We aim to provide ex-ante guarantees on the level of service provided to each agent, who may measure service in different ways (Type-I, II, or III), calling for CRS under different feasibility constraints (rank-1 matroid or knapsack). We are particularly interested in two-order CRS where the agents are equally likely to arrive in a known forward order or its reverse, which is motivated by online rationing at food banks. In particular, we derive a two-order CRS for rank-1 matroids with guarantee $1/(1+e^{-1/2})\approx 0.622$, which we prove is tight. This improves upon the $1/2$ guarantee that is best-possible under a single order (Alaei, SIAM J. Comput. 2014), while achieving separation with the $1-1/e\approx 0.632$ guarantee that is possible for random-order CRS (Lee and Singla, ESA 2018). Because CRS guarantees imply prophet inequalities, this also beats the two-order prophet inequality with ratio $(\sqrt{5}-1)/2\approx 0.618$ from (Arsenis, SODA 2021), which was tight for single-threshold policies. Rank-1 matroids suffice to provide guarantees under Type-II or III service, but Type-I service requires knapsack. Accordingly, we derive a two-order CRS for knapsack with guarantee $1/3$, improving upon the $1/(3+e^{-2})\approx 0.319$ guarantee that is best-possible under a single order (Jiang et al., SODA 2022). To our knowledge, $1/3$ provides the best-known guarantee for knapsack CRS even in the offline setting. Finally, we provide an upper bound of $1/(2+e^{-1})\approx 0.422$ for two-order knapsack CRS, strictly smaller than the upper bound of $(1-e^{-2})/2\approx0.432$ for random-order knapsack CRS.