SMaRT: Online Reusable Resource Assignment and an Application to Mediation in the Kenyan Judiciary

• URL: http://arxiv.org/abs/2602.18431v1
• Date: Fri, 20 Feb 2026 18:58:05 GMT
• Title: SMaRT: Online Reusable Resource Assignment and an Application to Mediation in the Kenyan Judiciary
• Authors: Shafkat Farabi, Didac Marti Pinto, Wei Lu, Manuel Ramos-Maqueda, Sanmay Das, Antoine Deeb, Anja Sautmann,
• Abstract summary: We study an online resource allocation problem where incoming tasks (cases) must be immediately assigned to available, capacity-constrained resources (mediators)<n>The scale of the real-world problem poses substantial challenges, since there are over 2000 mediators and a multitude of combinations of geographic locations (87) and case types (12) that each mediator is qualified to work on.<n>We formalize the problem in a tractable manner using a quadratic program formulation for assignment and a multi-agent bandit-style framework for learning.<n>We demonstrate the key properties and advantages of our new algorithm, SMaRT, compared with baselines on stylized instances of the mediator
• Score: 9.607971848086521
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Motivated by the problem of assigning mediators to cases in the Kenyan judicial, we study an online resource allocation problem where incoming tasks (cases) must be immediately assigned to available, capacity-constrained resources (mediators). The resources differ in their quality, which may need to be learned. In addition, resources can only be assigned to a subset of tasks that overlaps to varying degrees with the subset of tasks other resources can be assigned to. The objective is to maximize task completion while satisfying soft capacity constraints across all the resources. The scale of the real-world problem poses substantial challenges, since there are over 2000 mediators and a multitude of combinations of geographic locations (87) and case types (12) that each mediator is qualified to work on. Together, these features, unknown quality of new resources, soft capacity constraints, and a high-dimensional state space, make existing scheduling and resource allocation algorithms either inapplicable or inefficient. We formalize the problem in a tractable manner using a quadratic program formulation for assignment and a multi-agent bandit-style framework for learning. We demonstrate the key properties and advantages of our new algorithm, SMaRT (Selecting Mediators that are Right for the Task), compared with baselines on stylized instances of the mediator allocation problem. We then consider its application to real-world data on cases and mediators from the Kenyan judiciary. SMaRT outperforms baselines and allows control over the tradeoff between the strictness of capacity constraints and overall case resolution rates, both in settings where mediator quality is known beforehand and in bandit-like settings where learning is part of the problem definition. On the strength of these results, we plan to run a randomized controlled trial with SMaRT in the judiciary in the near future.

Related papers

• A Fair OR-ML Framework for Resource Substitution in Large-Scale Networks [14.634171922038675]
  This paper presents a generic framework that combines operations research (OR) and machine learning (ML) to enable fair resource substitution in large networks.<n>The framework is applied to the network of one of the largest package delivery companies in the world.
  arXiv  Detail & Related papers  (2025-11-23T03:38:41Z)
• Capacity-Constrained Continual Learning [64.70016365121081]
  This paper studies how agents with limited capacity should allocate their resources for optimal performance.<n>We derive a solution to the capacity-constrained linear-quadratic-Gaussian sequential prediction problem.<n>For problems that can be decomposed into a set of sub-problems, we also demonstrate how to optimally allocate capacity across these sub-problems in the steady state.
  arXiv  Detail & Related papers  (2025-07-29T03:47:22Z)
• Towards Principled Unsupervised Multi-Agent Reinforcement Learning [49.533774397707056]
  We present a scalable, decentralized, trust-region policy search algorithm to address the problem in practical settings.<n>We show that optimizing for a specific objective, namely mixture entropy, provides an excellent trade-off between tractability and performances.
  arXiv  Detail & Related papers  (2025-02-12T12:51:36Z)
• Active Learning for Fair and Stable Online Allocations [6.23798328186465]
  We consider feedback from a select subset of agents at each epoch of the online resource allocation process. Our algorithms provide regret bounds that are sub-linear in number of time-periods for various measures. We show that efficient decision-making does not require extensive feedback and produces efficient outcomes for a variety of problem classes.
  arXiv  Detail & Related papers  (2024-06-20T23:23:23Z)
• Decentralized Learning Strategies for Estimation Error Minimization with Graph Neural Networks [86.99017195607077]
  We address the challenge of sampling and remote estimation for autoregressive Markovian processes in a wireless network with statistically-identical agents.<n>Our goal is to minimize time-average estimation error and/or age of information with decentralized scalable sampling and transmission policies.
  arXiv  Detail & Related papers  (2024-04-04T06:24:11Z)
• Resource Allocation to Agents with Restrictions: Maximizing Likelihood with Minimum Compromise [28.2469613376685]
  We show that a Principle chooses a maximum matching randomly so that each agent is matched to a resource with some probability. Agents would like to improve their chances of being matched by modifying their restrictions within certain limits. We experimentally evaluate our methods on synthetic datasets as well as on two novel real-world datasets.
  arXiv  Detail & Related papers  (2022-09-12T11:58:19Z)
• A new perspective on classification: optimally allocating limited resources to uncertain tasks [4.169130102668252]
  In credit card fraud detection, for instance, a bank can only assign a small subset of transactions to their fraud investigations team. We argue that using classification to address task uncertainty is inherently suboptimal as it does not take into account the available capacity. We present a novel solution using learning to rank by directly optimizing the assignment's expected profit given limited capacity.
  arXiv  Detail & Related papers  (2022-02-09T10:14:45Z)
• Polynomial-Time Algorithms for Multi-Agent Minimal-Capacity Planning [19.614913673879474]
  We study the problem of minimizing the resource capacity of autonomous agents cooperating to achieve a shared task. In a consumption Markov decision process, the agent has a resource of limited capacity. We develop an algorithm that solves this graph problem in time that is emphpolynomial in the number of agents, target locations, and size of the consumption Markov decision process.
  arXiv  Detail & Related papers  (2021-05-04T00:30:02Z)
• Coordinated Online Learning for Multi-Agent Systems with Coupled Constraints and Perturbed Utility Observations [91.02019381927236]
  We introduce a novel method to steer the agents toward a stable population state, fulfilling the given resource constraints. The proposed method is a decentralized resource pricing method based on the resource loads resulting from the augmentation of the game's Lagrangian.
  arXiv  Detail & Related papers  (2020-10-21T10:11:17Z)
• Resource Allocation via Model-Free Deep Learning in Free Space Optical Communications [119.81868223344173]
  The paper investigates the general problem of resource allocation for mitigating channel fading effects in Free Space Optical (FSO) communications. Under this framework, we propose two algorithms that solve FSO resource allocation problems.
  arXiv  Detail & Related papers  (2020-07-27T17:38:51Z)
• A Non-Stationary Bandit-Learning Approach to Energy-Efficient Femto-Caching with Rateless-Coded Transmission [98.47527781626161]
  We study a resource allocation problem for joint caching and transmission in small cell networks. We then formulate the problem as to select a file from the cache together with a transmission power level for every broadcast round. In contrast to the state-of-the-art research, the proposed approach is especially suitable for networks with time-variant statistical properties.
  arXiv  Detail & Related papers  (2020-04-13T09:07: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.