<s>
The	O
Stromquist	B-Algorithm
moving-knives	I-Algorithm
procedure	I-Algorithm
is	O
a	O
procedure	O
for	O
envy-free	O
cake-cutting	O
among	O
three	O
players	O
.	O
</s>
<s>
The	O
moving-knives	O
procedure	O
can	O
be	O
adapted	O
for	O
chore	B-Algorithm
division	I-Algorithm
-	O
dividing	O
a	O
cake	O
with	O
a	O
negative	O
value	O
.	O
</s>
