ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Allocation”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.LGmath.OCmath.PREmpiricalRecentJun 9, 2026

Data-Driven Dynamic Assortment in Online Platforms: Learning about Two Sides

Rahul Roy, Nur Sunar, Jayashankar M. Swaminathan

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…

View →
cs.GTcs.MATheoreticalRecentJun 19, 2026

Simultaneously Efficient Allocation of Indivisible Items Across Multiple Dimensions

Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui

This paper studies the efficiency of allocating indivisible items with multiple attributes to agents with additive valuations.

View →
cs.CRApr 17, 2026

Privacy, Prediction, and Allocation

Ben Jacobsen, Nitin Kohli

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.

View →
cs.DScs.GTcs.LGTheoreticalRecentJun 17, 2026

Fair Online Resource Allocation

Christopher En, Yuri Faenza, Andrea Lodi, Gonzalo Muñoz

This paper studies fair online resource allocation with a Lipschitz fairness requirement and proposes an algorithm to maximize welfare while enforcing fairness.

View →
cs.AREmpiricalRecentJul 16, 2026

Valinor: Architectural Support for Fast, Energy-Efficient and Programmable Physical Memory Allocation

Konstantinos Kanellopoulos, Spiros Galanopoulos, Konstantinos Sgouras, Vlad-Petru Nitu +6 more

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…

View →
cs.ROEmpiricalRecentJun 23, 2026

Varying Bundle Size Reactive Multi-Task Assignment using Selective Cost Estimation for Multi-Agent Systems

Niklas Dahlquist, Shridhar Velhal, George Nikolakopoulos

The paper presents a scalable framework for multi-robot task allocation in complex environments.

View →
cs.ROcs.MAEmpiricalRecentOct 20, 2026

Robot-Task Suitability in Heterogeneous Multi-Robot Task Allocation

Daniel Weiner, Raj Korpan

This paper compares ten deterministic and two LLM-based methods for estimating robot suitability for tasks.

View →
cs.GTcs.ITeess.SPTheoreticalRecentAug 3, 2026

House-monotone multi-level apportionment has logarithmic quota discrepancy

Lav R. Varshney

This paper proves that no house-monotone quota rule exists for multi-level apportionment with optimal worst-case error on the comb.

View →
cs.GTcs.CCcs.DSTheoreticalRecentOct 20, 2026

Subjective Valuations Make It Hard to be Fair: The Complexity of Resource Allocation to Groups of Agents

Argyrios Deligkas, Eduard Eiben, Robert Ganian, Tiger-Lily Goldsmith +2 more

This paper studies the parameterized complexity of finding an EF1 allocation of indivisible items in the group-sharing setting.

View →
cs.DSTheoreticalRecentJun 21, 2026

Submodular Welfare Maximization with Budget Constraints in the Random-Order Model

Max Klimm, Martin Knaack

This paper presents improved algorithms for an online item-allocation problem with budgets and a submodular objective.

View →
cs.LGcs.AIcs.DCTheoreticalRecentJun 26, 2026

Towards Value-Constrained Credit Assignment in Fully Delegated AI Cooperatives

Young Yoon, Jimin Kim, Soyeon Park

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…

View →
cs.DScs.DMTheoreticalRecentJul 28, 2026

Stochastic Load Balancing with Machine Reservations

David Alemán Espinosa, Naveen Garg, Sharat Ibrahimpur, Neil Olver +1 more

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…

View →
cs.DSTheoreticalRecentJun 19, 2026

Online Stacking with a Few Load/Unload Points

Martin Olsen

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.

View →
cs.DScs.CCTheoreticalRecentNov 12, 2026

Individually Fair Facility Location

Rajni Dabas, Samir Khuller, Milind Maiti

The paper studies the problem of individually fair facility location and provides a polynomial-time algorithm with a constant cost factor.

View →
cs.NEEmpiricalRecentJul 25, 2026

A genetic algorithm for student academic resource allocation

Ana F. Hernández, Andrej Franulic, Fernando Jiménez

This paper proposes a Genetic Algorithm with constraint repair mechanism for optimally allocating educational resources to high school mathematics students under study time constraints.

View →
cs.CLcs.AIcs.LGRecentMay 28, 2026

Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits

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…

View →