2 papers
cs.GT2026
On Cutting Cakes and Crossing Curves
Alexandros Hollender, Gilbert Maystre, Kilian Risse
We consider the classic envy-free cake-cutting problem where the goal is to cut and allocate a divisible resource among a set of agents in a way that avoids any envy between them.…
cs.DS2020
Communication Efficient Coresets for Maximum Matching
Michael Kapralov, Gilbert Maystre, Jakab Tardos
In this paper we revisit the problem of constructing randomized composable coresets for bipartite matching. In this problem the input graph is randomly partitioned across playe…