<s>
The	O
Selfridge	B-Algorithm
–	I-Algorithm
Conway	I-Algorithm
procedure	I-Algorithm
is	O
a	O
discrete	O
procedure	O
that	O
produces	O
an	O
envy-free	O
cake-cutting	O
for	O
three	O
partners	O
.	O
</s>
<s>
we	O
allow	O
free	O
disposal	O
)	O
,	O
then	O
we	O
only	O
need	O
to	O
use	O
the	O
first	O
part	O
of	O
the	O
Selfridge	B-Algorithm
–	I-Algorithm
Conway	I-Algorithm
procedure	I-Algorithm
,	O
i.e.	O
</s>
<s>
A	O
refinement	O
of	O
this	O
infinite	O
procedure	O
yields	O
a	O
finite	O
envy-free	O
division	O
procedure	O
:	O
the	O
Brams	B-Algorithm
–	I-Algorithm
Taylor	I-Algorithm
procedure	I-Algorithm
.	O
</s>
