Contextual Budget Bandit for Food Rescue Volunteer Engagement

• URL: http://arxiv.org/abs/2509.10777v1
• Date: Sat, 13 Sep 2025 01:49:00 GMT
• Title: Contextual Budget Bandit for Food Rescue Volunteer Engagement
• Authors: Ariana Tang, Naveen Raman, Fei Fang, Zheyuan Ryan Shi,
• Abstract summary: Volunteer-based food rescue platforms tackle food waste by matching surplus food to communities in need.<n>Existing algorithms to improve volunteer engagement exacerbate geographical disparities, leaving some communities systematically disadvantaged.<n>We propose Contextual Budget Bandit, which incorporates context-dependent budget allocation in restless multi-armed bandits.
• Score: 13.339011713989628
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Volunteer-based food rescue platforms tackle food waste by matching surplus food to communities in need. These platforms face the dual problem of maintaining volunteer engagement and maximizing the food rescued. Existing algorithms to improve volunteer engagement exacerbate geographical disparities, leaving some communities systematically disadvantaged. We address this issue by proposing Contextual Budget Bandit. Contextual Budget Bandit incorporates context-dependent budget allocation in restless multi-armed bandits, a model of decision-making which allows for stateful arms. By doing so, we can allocate higher budgets to communities with lower match rates, thereby alleviating geographical disparities. To tackle this problem, we develop an empirically fast heuristic algorithm. Because the heuristic algorithm can achieve a poor approximation when active volunteers are scarce, we design the Mitosis algorithm, which is guaranteed to compute the optimal budget allocation. Empirically, we demonstrate that our algorithms outperform baselines on both synthetic and real-world food rescue datasets, and show how our algorithm achieves geographical fairness in food rescue.

Related papers

• Beyond Manual Planning: Seating Allocation for Large Organizations [16.77097902601697]
  We introduce the Hierarchical Seating Allocation Problem (HSAP) which addresses the optimal assignment of hierarchically structured teams to physical seating arrangements on a floor plan.<n>This problem is driven by the necessity for large organizations with large hierarchies to ensure that teams with close hierarchical relationships are seated in proximity to one another, such as ensuring a research group occupies a contiguous area.<n>A scalable approach to calculate the distance between any pair of seats using a road map and rapidly-exploring random trees (RRT) which is combined with a probabilistic search and dynamic programming approach to solve the HSAP using integer programming.
  arXiv  Detail & Related papers  (2026-02-05T16:52:44Z)
• A Branch-and-Price Algorithm for Fast and Equitable Last-Mile Relief Aid Distribution [0.910208503367801]
  In disasters, prepositioned supplies often fall short of meeting all demands.<n>We address the problem of planning vehicle routes from a distribution center to shelters while allocating limited relief supplies.<n>Our bi-objective approach reduces aid distribution inequity by 34% without compromising efficiency.
  arXiv  Detail & Related papers  (2025-12-22T21:16:52Z)
• No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need! [56.80767500991973]
  We focus on two canonical settings: $(i)$ online resource allocation where rewards and costs are observed before action selection, and $(ii)$ online learning with resource constraints where they are observed after action selection, under full feedback or bandit feedback.<n>It is well known that achieving sublinear regret in these settings is impossible when reward and cost distributions may change arbitrarily over time.<n>We design general (primal-)dual methods that achieve sublinear regret with respect to baselines that follow the spending plan. Crucially, the performance of our algorithms improves when the spending plan ensures a well-balanced distribution of the budget
  arXiv  Detail & Related papers  (2025-06-16T08:42:31Z)
• A Multiagent Path Search Algorithm for Large-Scale Coalition Structure Generation [61.08720171136229]
  Coalition structure generation is a fundamental computational problem in multiagent systems.<n>We develop SALDAE, a multiagent path finding algorithm for CSG that operates on a graph of coalition structures.
  arXiv  Detail & Related papers  (2025-02-14T15:21:27Z)
• A Simulation-Based Framework for Leveraging Shared Autonomous Vehicles to Enhance Disaster Evacuations in Rural Regions with a Focus on Vulnerable Populations [0.210674772139335]
  This study proposes a framework to deploy SAVs in pre- and post-disaster evacuations in rural areas.<n>The framework prioritizes the needs of vulnerable groups, including individuals with disabilities, limited English proficiency, and elderly residents.
  arXiv  Detail & Related papers  (2025-01-20T00:12:31Z)
• A Distance Similarity-based Genetic Optimization Algorithm for Satellite Ground Network Planning Considering Feeding Mode [53.71516191515285]
  The low transmission efficiency of the satellite data relay back mission has become a problem that is currently constraining the construction of the system. We propose a distance similarity-based genetic optimization algorithm (DSGA), which considers the state characteristics between the tasks and introduces a weighted Euclidean distance method to determine the similarity between the tasks.
  arXiv  Detail & Related papers  (2024-08-29T06:57:45Z)
• Automating Food Drop: The Power of Two Choices for Dynamic and Fair Food Allocation [51.687404103375506]
  We partner with a non-profit organization in the state of Indiana that leads emphFood Drop, a program that is designed to redirect rejected truckloads of food away from landfills and into food banks. Our goal in this partnership is to completely automate Food Drop. In doing so, we need a matching algorithm for making real-time decisions that strikes a balance between ensuring fairness for the food banks that receive the food and optimizing efficiency for the truck drivers.
  arXiv  Detail & Related papers  (2024-06-10T15:22:41Z)
• Optimal Multi-Fidelity Best-Arm Identification [65.23078799972188]
  In bandit best-arm identification, an algorithm is tasked with finding the arm with highest mean reward with a specified accuracy as fast as possible.<n>We study multi-fidelity best-arm identification, in which the can choose to sample an arm at a lower fidelity (less accurate mean estimate) for a lower cost.<n>Several methods have been proposed for tackling this problem, but their optimality remain elusive, notably due to loose lower bounds on the total cost needed to identify the best arm.
  arXiv  Detail & Related papers  (2024-06-05T08:02:40Z)
• A resource-constrained stochastic scheduling algorithm for homeless street outreach and gleaning edible food [29.017017395878597]
  We developed a common algorithmic solution addressing the problem of resource-constrained outreach encountered by social change organizations with different missions and operations. We developed an estimation and optimization approach for partially-observed episodic restless bandits under $k$-step transitions.
  arXiv  Detail & Related papers  (2024-03-15T19:12:28Z)
• Confounded Budgeted Causal Bandits [28.199741662190203]
  We study the problem of learning 'good' interventions in an environment modeled by its underlying causal graph. Good interventions refer to interventions that maximize rewards. We propose an algorithm to minimize the cumulative regret in general causal graphs.
  arXiv  Detail & Related papers  (2024-01-15T10:26:13Z)
• Nash Welfare and Facility Location [82.81742334337336]
  We consider the problem of locating a facility to serve a set of agents located along a line. The Nash welfare objective function, defined as the product of the agents' utilities, is known to provide a compromise between fairness and efficiency.
  arXiv  Detail & Related papers  (2023-10-06T09:06:44Z)
• Equity Promotion in Public Transportation [18.057286025603055]
  We propose an optimization model to study how to integrate the two approaches together for equity-promotion purposes. We have designed a linear-programming (LP) based rounding algorithm, which proves to achieve an optimal approximation ratio of 1-1/e. Experimental results confirm our theoretical predictions and demonstrate the effectiveness of our LP-based strategy in promoting social equity.
  arXiv  Detail & Related papers  (2022-11-26T10:06:00Z)
• Corralling Stochastic Bandit Algorithms [54.10645564702416]
  We show that the regret of the corralling algorithms is no worse than that of the best algorithm containing the arm with the highest reward. We show that the gap between the highest reward and other rewards depends on the gap between the highest reward and other rewards.
  arXiv  Detail & Related papers  (2020-06-16T15:33:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.