Automating Food Drop: The Power of Two Choices for Dynamic and Fair Food Allocation

• URL: http://arxiv.org/abs/2406.06363v1
• Date: Mon, 10 Jun 2024 15:22:41 GMT
• Title: Automating Food Drop: The Power of Two Choices for Dynamic and Fair Food Allocation
• Authors: Marios Mertzanidis, Alexandros Psomas, Paritosh Verma,
• Abstract summary: 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.
• Score: 51.687404103375506
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Food waste and food insecurity are two closely related pressing global issues. Food rescue organizations worldwide run programs aimed at addressing the two problems. In this paper, we partner with a non-profit organization in the state of Indiana that leads \emph{Food Drop}, a program that is designed to redirect rejected truckloads of food away from landfills and into food banks. The truckload to food bank matching decisions are currently made by an employee of our partner organization. In addition to this being a very time-consuming task, as perhaps expected from human-based matching decisions, the allocations are often skewed: a small percentage of the possible recipients receives the majority of donations. 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. In this paper, we describe the theoretical guarantees and experiments that dictated our choice of algorithm in the platform we built and deployed for our partner organization. Our work also makes contributions to the literature on load balancing and balls-into-bins games, that might be of independent interest. Specifically, we study the allocation of $m$ weighted balls into $n$ weighted bins, where each ball has two non-uniformly sampled random bin choices, and prove upper bounds, that hold with high probability, on the maximum load of any bin.

Related papers

• Where to Build Food Banks and Pantries: A Two-Level Machine Learning Approach [5.373182035720355]
  44 million Americans suffer from food insecurity, of whom 13 million are children. By optimizing food bank and pantry locations, food would become more accessible to families who desperately require it.
  arXiv  Detail & Related papers  (2024-10-20T15:31:24Z)
• RoDE: Linear Rectified Mixture of Diverse Experts for Food Large Multi-Modal Models [96.43285670458803]
  Uni-Food is a unified food dataset that comprises over 100,000 images with various food labels. Uni-Food is designed to provide a more holistic approach to food data analysis. We introduce a novel Linear Rectification Mixture of Diverse Experts (RoDE) approach to address the inherent challenges of food-related multitasking.
  arXiv  Detail & Related papers  (2024-07-17T16:49:34Z)
• Imperfect-Recall Games: Equilibrium Concepts and Their Complexity [74.01381499760288]
  We investigate optimal decision making under imperfect recall, that is, when an agent forgets information it once held before. In the framework of extensive-form games with imperfect recall, we analyze the computational complexities of finding equilibria in multiplayer settings.
  arXiv  Detail & Related papers  (2024-06-23T00:27:28Z)
• Online Fair Allocation of Perishable Resources [1.4952056744888913]
  We consider a practically motivated variant of the canonical online fair allocation problem. A decision-maker has a budget of perishable resources to allocate over a fixed number of rounds. The goal is to construct a sequence of allocations that is envy-free and efficient.
  arXiv  Detail & Related papers  (2024-06-04T15:14:10Z)
• Fair Allocation in Dynamic Mechanism Design [57.66441610380448]
  We consider a problem where an auctioneer sells an indivisible good to groups of buyers in every round, for a total of $T$ rounds. The auctioneer aims to maximize their discounted overall revenue while adhering to a fairness constraint that guarantees a minimum average allocation for each group.
  arXiv  Detail & Related papers  (2024-05-31T19:26:05Z)
• 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)
• Probably Anytime-Safe Stochastic Combinatorial Semi-Bandits [81.60136088841948]
  We propose an algorithm that minimizes the regret over the horizon of time $T$. The proposed algorithm is applicable to domains such as recommendation systems and transportation.
  arXiv  Detail & Related papers  (2023-01-31T03:49:00Z)
• Neural Payoff Machines: Predicting Fair and Stable Payoff Allocations Among Team Members [13.643650155415484]
  We show how cooperative game-theoretic solutions can be distilled into a learned model by training neural networks. Our approach creates models that can generalize to games far from the training distribution. An important application of our framework is Explainable AI.
  arXiv  Detail & Related papers  (2022-08-18T12:33:09Z)
• A Framework for Multi-stage Bonus Allocation in meal delivery Platform [14.64089765133449]
  We propose a framework to deal with the multi-stage bonus allocation problem for a meal delivery platform. The proposed framework consists of a semi-black-box acceptance probability model, a Lagrangian dual-based dynamic programming algorithm, and an online allocation algorithm. Our results show that using the proposed framework, the total order cancellations can be decreased by more than 25% in reality.
  arXiv  Detail & Related papers  (2022-02-22T06:52:34Z)
• Cross-Modal Food Retrieval: Learning a Joint Embedding of Food Images and Recipes with Semantic Consistency and Attention Mechanism [70.85894675131624]
  We learn an embedding of images and recipes in a common feature space, such that the corresponding image-recipe embeddings lie close to one another. We propose Semantic-Consistent and Attention-based Networks (SCAN), which regularize the embeddings of the two modalities through aligning output semantic probabilities. We show that we can outperform several state-of-the-art cross-modal retrieval strategies for food images and cooking recipes by a significant margin.
  arXiv  Detail & Related papers  (2020-03-09T07:41:17Z)

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.