Skip to content

Author

Nawal Benabbou

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

On the Convergence of Iterated Round Robin

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 additive. Despite being manipulable (meaning that agents may have an incentive to strategically misreport their preferences), it is known t...

Maxime Lucet, Henri Surugue, Nawal Benabbou et al. · 0 citations
Preprint Aug 2026

Multilevel Fair Allocation under Additive Preferences

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 bundle to its children, the overall allocation being a trace of this process iterated down to the leaves. Assuming that internal nodes'utilitie...

Maxime Lucet, Nawal Benabbou, A. Beynier et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.