<s>
Draw	O
a	O
random	B-Algorithm
permutation	I-Algorithm
of	O
the	O
agents	O
from	O
the	O
uniform	O
distribution	O
.	O
</s>
<s>
An	O
alternative	O
rule	O
,	O
the	O
probabilistic-serial	B-Algorithm
rule	I-Algorithm
,	O
is	O
sd-efficient	O
(	O
which	O
implies	O
ex-post	O
PE	O
)	O
and	O
sd-envy-free	O
(	O
which	O
implies	O
ex-ante	O
envy-freeness	O
)	O
,	O
but	O
it	O
is	O
not	O
truthful	O
.	O
</s>
<s>
Another	O
way	O
is	O
to	O
let	O
each	O
agent	O
pick	O
a	O
single	O
object	O
,	O
and	O
then	O
do	O
another	O
round	O
in	O
which	O
each	O
agent	O
picks	O
a	O
single	O
object	O
,	O
until	O
all	O
objects	O
are	O
taken	O
;	O
this	O
leads	O
to	O
the	O
round-robin	B-Algorithm
item	I-Algorithm
allocation	I-Algorithm
procedure	O
.	O
</s>
<s>
Both	O
procedures	O
are	O
special	O
cases	O
of	O
a	O
picking	B-Algorithm
sequence	I-Algorithm
.	O
</s>
