让下一篇重要论文，不再错过。

原文摘要

We study multidimensional online generalized assignment under nonstationary arrivals, motivated by resource allocation for large language model agent services. Providers may commit model and tool allowances to agent tasks upon admission, reserving budgets for their internal execution loops. Each request is rejected or accepted with an irrevocable assignment to one compatible server, earning reward and consuming a vector of its nonreplenishing budgets. Arrivals are independent with known, potentially time-varying type distributions. Scalar reductions can discard feasible combinations of requests with complementary resource requirements. To maximize expected reward, we develop Vector-Aware Best-Fit, which combines linear-programming-guided candidate routing with calibrated acceptance while retaining vector feasibility. Relative to the expected clairvoyant offline optimum, its guarantee improves on scalar reduction in the multidimensional case and has the best possible inverse-dimensional order. With an appropriate acceptance parameter, the proposed policy attains the optimal competitive ratio on all-heavy instances, where every feasible assignment consumes more than half of at least one resource budget. We further develop two heuristics that retain its performance guarantee. Computational results show that the heuristics perform well against benchmarks in most tested settings, especially when capacity is scarce relative to demand.