<s>
The	O
fair	B-Algorithm
pie-cutting	I-Algorithm
problem	O
is	O
a	O
variation	O
of	O
the	O
fair	O
cake-cutting	O
problem	O
,	O
in	O
which	O
the	O
resource	O
to	O
be	O
divided	O
is	O
circular	O
.	O
</s>
<s>
Stromquist	B-Algorithm
moving-knives	I-Algorithm
procedure	I-Algorithm
can	O
be	O
used	O
to	O
cut	O
a	O
cake	O
in	O
1	O
dimension	O
,	O
so	O
obviously	O
it	O
can	O
also	O
be	O
used	O
to	O
cut	O
a	O
pie	O
.	O
</s>
<s>
This	O
is	O
analogous	O
to	O
an	O
impossibility	O
result	O
for	O
1-dimensional	O
interval	O
cake	O
and	O
2	O
partners	O
(	O
see	O
proportional	B-Algorithm
cake-cutting	I-Algorithm
with	I-Algorithm
different	I-Algorithm
entitlements	I-Algorithm
)	O
.	O
</s>
