7 citations · 9 across the 7 of their papers we have counts for
Showing 2026 · cs.GTShow all
2 papers · 2 filters
cs.GT2026
On the Convergence of Iterated Round Robin
Maxime Lucet, Henri Surugue, Nawal Benabbou +3
Round Robin (RR) is a simple and widely used picking sequence mechanism for allocating indivisible goods, known to guarantee envy-freeness up to one item (EF1) when preferences are…
cs.GT2026
Multilevel Fair Allocation under Additive Preferences
Maxime Lucet, Nawal Benabbou, Aurélie Beynier +1
We study multilevel fair resource allocation with tree-structured hierarchical relations among agents. At each level, the problem can be viewed locally as allocating an agent's bun…