2 papers
cs.DS2026
Leveraging Recourse and Size Bounds for OnlineKnapsack with Removable Items
Dimitris Fotakis, Laurent Gourvès, Aris Pagourtzis +1
In the online unweighted knapsack problem, items arrive sequentially and must be accepted or rejected immediately for a bounded-capacity knapsack, aiming to maximize the total size…
cs.GT2025
Satisfactory Budget Division
Laurent Gourvès, Michael Lampis, Nikolaos Melissinos +1
A divisible budget must be allocated to several projects, and agents are asked for their opinion on how much they would give to each project. We consider that an agent is satisfied…