paper-with-me

Papers

A resource-constrained stochastic scheduling algorithm for homeless street outreach and gleaning edible food

2024-03-15 · Conor M. Artman, Aditya Mate, Ezinne Nwankwo, Aliza Heching, Tsuyoshi Idé, Jiří\, Navrátil, Karthikeyan Shanmugam, Wei Sun, Kush R. Varshney, Lauri Goldkind, Gidi Kroch, Jaclyn Sawyer, Ian Watson

We developed a common algorithmic solution addressing the problem of resource-constrained outreach encountered by social change organizations with different missions and operations: Breaking Ground -- an organization that helps individuals experiencing homelessness in New York transition to permanent housing and Leket -- the national food bank of Israel that rescues food from farms and elsewhere to feed the hungry. Specifically, we developed an estimation and optimization approach for partially-observed episodic restless bandits under $k$-step transitions. The results show that our Thompson sampling with Markov chain recovery (via Stein variational gradient descent) algorithm significantly outperforms baselines for the problems of both organizations. We carried out this work in a prospective manner with the express goal of devising a flexible-enough but also useful-enough solution that can help overcome a lack of sustainable impact in data science for social good.

📄 PDF Abstract BibTeX arXiv:2403.10638

Code (0)

등록된 구현이 없습니다.

Tasks

SchedulingThompson Sampling

Similar Papers 제목 키워드 기반

Proactive and Reactive Constraint Programming for Stochastic Project Scheduling with Maximal Time-Lags

2024-09-13 · Kim van den Houten, Léon Planken, Esteban Freydell, David M. J. Tax 외

This study investigates scheduling strategies for the stochastic resource-constrained project scheduling problem with maximal time lags (SRCPSP/max)). Recent advances in Constraint Programming (CP) and Temporal Networks …

Scheduling

Learning Resource Allocation Policies from Observational Data with an Application to Homeless Services Delivery

2022-01-25 · Aida Rahmattalabi, Phebe Vayanos, Kathryn Dullerud, Eric Rice

We study the problem of learning, from observational data, fair and interpretable policies that effectively match heterogeneous individuals to scarce resources of different types. We model this problem as a multi-class m…

Causal InferenceFairnessManagement

Toward AI Matching Policies in Homeless Services: A Qualitative Study with Policymakers

2025-08-10 · Caroline M. Johnston, Olga Koumoundouros, Angel Hsing-Chi Hwang, Laura Onasch-Vera 외 arxiv

Artificial intelligence researchers have proposed various data-driven algorithms to improve the processes that match individuals experiencing homelessness to scarce housing resources. It remains unclear whether and how t…

Context-aware Constrained Reinforcement Learning Based Energy-Efficient Power Scheduling for Non-stationary XR Data Traffic

2025-03-12 · Kexuan Wang, An Liu

In XR downlink transmission, energy-efficient power scheduling (EEPS) is essential for conserving power resource while delivering large data packets within hard-latency constraints. Traditional constrained reinforcement …

Scheduling

Information Entropy-Based Scheduling for Communication-Efficient Decentralized Learning

2025-07-23 · Jaiprakash Nagar, Zheng Chen, Marios Kountouris, Photios A. Stavrou arxiv

This paper addresses decentralized stochastic gradient descent (D-SGD) over resource-constrained networks by introducing node-based and link-based scheduling strategies to enhance communication efficiency. In each iterat…