2 citations · 2 across the 6 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Submodular Welfare Maximization with Budget Constraints in the Random-Order Model
Max Klimm, Martin Knaack
We study an online item-allocation problem with budgets and a submodular objective. A set of agents is known in advance, and each agent has a known budget. A set of ite…
math.OC2026
Faster Symmetric Rendezvous on Four or More Locations
Javier Cembrano, Felix Fischer, Max Klimm
In the symmetric rendezvous problem, two players follow the same (randomized) strategy to visit one of locations in each time step . Their goal is to minimize th…