Before revision:  Moreover, we establish that a generalization of the round-robin picking sequence  produces in polynomial time a strongly WEF1 allocation for an arbitrary number of agents;
After revision:  Moreover, we establish that a generalization of the round-robin picking sequence algorithm produces in polynomial time a strongly WEF1 allocation for an arbitrary number of agents;