<s>
The	O
Austin	B-Algorithm
moving-knife	I-Algorithm
procedures	I-Algorithm
are	O
procedures	O
for	O
equitable	O
division	O
of	O
a	O
cake	O
.	O
</s>
<s>
By	O
combining	O
with	O
the	O
Fink	B-Algorithm
protocol	I-Algorithm
,	O
it	O
is	O
possible	O
to	O
divide	O
a	O
cake	O
to	O
partners	O
,	O
such	O
that	O
each	O
partner	O
receives	O
a	O
piece	O
worth	O
exactly	O
for	O
him	O
:	O
</s>
