20 results for “Allocation”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper studies a dynamic assortment problem on a two-sided service platform with incomplete information and heterogeneous customers, and develops a data-driven algorithm to learn parameters and op…
This paper studies the efficiency of allocating indivisible items with multiple attributes to agents with additive valuations.
This paper analyzes the trade-offs between privacy, efficiency, and targeting precision in aid allocation systems by studying private variants of both individual and unit-level allocation strategies.
This paper studies fair online resource allocation with a Lipschitz fairness requirement and proposes an algorithm to maximize welfare while enforcing fairness.
Valinor is a hardware-OS cooperative memory allocation substrate that introduces a programmable hardware allocation engine for improving performance and reducing energy consumption in virtual-to-physi…
The paper presents a scalable framework for multi-robot task allocation in complex environments.
This paper compares ten deterministic and two LLM-based methods for estimating robot suitability for tasks.
This paper proves that no house-monotone quota rule exists for multi-level apportionment with optimal worst-case error on the comb.
This paper studies the parameterized complexity of finding an EF1 allocation of indivisible items in the group-sharing setting.
This paper presents improved algorithms for an online item-allocation problem with budgets and a submodular objective.
This paper proposes a framework for reward allocation in AI cooperatives using value-conditioned gradient filtering, online marginal contribution signals, and cumulative revenue settlement within a tr…
A new stochastic load balancing model is introduced that allows for a tradeoff between non-adaptive policies and performance, with results showing a 2-reservation approximation to the omniscient optim…
A simple online algorithm is presented for the stacking problem to avoid shifts with a sufficient condition involving stacking area dimension, load/unload points, and maximum items.
The paper studies the problem of individually fair facility location and provides a polynomial-time algorithm with a constant cost factor.
This paper proposes a Genetic Algorithm with constraint repair mechanism for optimally allocating educational resources to high school mathematics students under study time constraints.
Sixue Xing, Haoyu He, Kerui Wu, Zhuo Yang +3 more
The paper proposes BaSE, a multi-armed bandit approach, to optimally allocate a fixed budget of LLM calls across parallel evolutionary search trajectories, significantly improving mean fitness and rel…