<s>
Edmonds	B-Algorithm
–	I-Algorithm
Pruhs	I-Algorithm
protocol	I-Algorithm
is	O
a	O
protocol	O
for	O
fair	O
cake-cutting	O
.	O
</s>
<s>
It	O
is	O
a	O
randomized	B-General_Concept
algorithm	I-General_Concept
whose	O
running	O
time	O
is	O
O(n )	O
with	O
probability	O
close	O
to	O
1	O
.	O
</s>
<s>
One	O
case	O
which	O
is	O
not	O
covered	O
by	O
the	O
hardness	O
results	O
is	O
the	O
case	O
of	O
randomized	B-General_Concept
algorithms	I-General_Concept
,	O
guaranteeing	O
only	O
partial	O
proportionality	O
and	O
with	O
possibly	O
disconnected	O
pieces	O
.	O
</s>
<s>
The	O
Edmonds	B-Algorithm
–	I-Algorithm
Pruhs	I-Algorithm
protocol	I-Algorithm
aims	O
to	O
provide	O
an	O
algorithm	O
with	O
run-time	O
O(n )	O
for	O
this	O
case	O
.	O
</s>
<s>
This	O
model	O
has	O
found	O
wide	O
applications	O
in	O
areas	O
such	O
as	O
load	B-Application
balancing	I-Application
.	O
</s>
<s>
Roughly	O
speaking	O
,	O
load-balancing	O
of	O
identical	O
machines	O
is	O
to	O
balls	O
and	O
bins	O
,	O
as	O
load	B-Application
balancing	I-Application
on	O
unrelated	O
machines	O
is	O
to	O
cake-cutting	O
.	O
</s>
<s>
Hence	O
,	O
it	O
is	O
reasonable	O
that	O
the	O
cake	O
model	O
and	O
the	O
Edmonds	B-Algorithm
–	I-Algorithm
Pruhs	I-Algorithm
protocol	I-Algorithm
should	O
have	O
interesting	O
applications	O
in	O
settings	O
involving	O
load	B-Application
balancing	I-Application
on	O
unrelated	O
machines	O
.	O
</s>
