The paper introduces a Physics‑Informed Multi‑Agent Coordination framework that embeds calibrated BCMP queueing topologies into a decentralized multi‑agent reinforcement learning system for hospital patient flow. It formulates the problem as a Decentralized Partially Observable Markov Decision Process with coupled resource constraints, enabling departmental agents to negotiate patient routing and service scaling while exchanging localized action fingerprints to handle non‑stationarity. Empirical tests on MIMIC‑IV data show the approach reduces cumulative system delay compared to static Markovian models, heuristic dispatching, and independent multi‑agent baselines, all while preserving clinical safety constraints.
By Guoqing Zhang, Rafik Hadfi, Takayuki Ito
arXiv:2608. 04669v1 Announce Type: new Abstract: Many social services assign scarce resources, such as housing assistance or hospital interventions, to people who arrive one at a time: each arrival must receive a decision immediately, and the long-run usage of every resource must stay within its capacity.
By Mohammadsaeed Haghi, Mahdi Salmani, Nima Kelidari
arXiv:2606. 30650v1 Announce Type: cross Abstract: Educational support services often face a qualified-capacity problem: staff time is scarce, qualifications decay, new support needs can appear before anyone is prepared for them, and training consumes the same hours needed by current students.
By Carlos Eduardo Sanoja, Oscar Enrique Moreno Mayz
arXiv:2510. 15127v3 Announce Type: replace-cross Abstract: Identifying the effects of mechanical ventilation (MV) protocols in critical care requires analyzing data from heterogeneous patient-ventilator systems in the clinical decision-making environment.
By David J. Albers, Tell D. Bennett, Jana de Wiljes, George Hripcsak, Bradford J. Smith, Peter D. Sottile, J. N. Stroh
arXiv:2607. 08793v1 Announce Type: cross Abstract: Sepsis is a leading cause of mortality, yet optimal treatment policies remain contested.
By Joshua Pickard, Wei Qi, Na Li, Ann Woolley, Lisa Cosimi, Roy Kishony, Deborah Hung
The paper proposes a method for allocating a limited budget of expert annotations to optimize the accuracy of off-policy evaluation in settings where rewards are missing or noisy. By deriving variance‑optimal annotation probabilities for sequential, forward‑monotone protocols, the authors provide a batch‑adaptive implementation that can be applied to real data. Experiments on casenotes from a homelessness services nonprofit and on human‑preference votes from LMArena demonstrate substantial reductions in RMSE—up to 65% for housing placement and 68% for progress toward a housing application—when using only 40% or more of the full annotation budget.
By Woojin Chae, Ezinne Nwankwo, Haitong Qin, Angela Zhou