2 citations · 3 across the 5 of their papers we have counts for
5 papers
Complete EFX Allocations Exist for Four Additive Agents and Up to Nine Goods
Eyad Alkassar, Mahmoud Fouz, Kurt Mehlhorn
We prove that every fair-division instance with four agents, additive valuations over the non-negative reals, and at most nine indivisible goods admits a \emph{complete} allocation…
Approximation Algorithms for Non-Single-minded Profit-Maximization Problems with Limited Supply
Khaled Elbassioni, Mahmoud Fouz, Chaitanya Swamy
We consider {\em profit-maximization} problems for {\em combinatorial auctions} with {\em non-single minded valuation functions} and {\em limited supply}. We obtain fairly general…
Asymptotically Optimal Randomized Rumor Spreading
Benjamin Doerr, Mahmoud Fouz
We propose a new protocol solving the fundamental problem of disseminating a piece of information to all members of a group of n players. It builds upon the classical randomized ru…
Quasi-Random Rumor Spreading: Reducing Randomness Can Be Costly
Benjamin Doerr, Mahmoud Fouz
We give a time-randomness tradeoff for the quasi-random rumor spreading protocol proposed by Doerr, Friedrich and Sauerwald [SODA 2008] on complete graphs. In this protocol, the go…
Hereditary Discrepancies in Different Numbers of Colors II
Benjamin Doerr, Mahmoud Fouz
We bound the hereditary discrepancy of a hypergraph $\HH$ in two colors in terms of its hereditary discrepancy in colors. We show that $\herdisc(\HH,2) \le K c \herdisc(\HH,c)$…