<s>
The	O
Simmons	B-Algorithm
–	I-Algorithm
Su	I-Algorithm
protocols	I-Algorithm
are	O
several	O
protocols	O
for	O
envy-free	O
division	O
.	O
</s>
<s>
Su	O
's	O
protocol	O
operates	O
on	O
a	O
dualized	O
version	O
of	O
this	O
simplex	O
in	O
a	O
similar	O
way	O
to	O
the	O
Simmons	B-Algorithm
–	I-Algorithm
Su	I-Algorithm
protocols	I-Algorithm
for	O
cake-cutting	O
:	O
for	O
every	O
vertex	O
of	O
a	O
triangulation	O
of	O
the	O
dual	O
simplex	O
,	O
which	O
corresponds	O
to	O
a	O
certain	O
price	O
scheme	O
,	O
it	O
asks	O
the	O
owning	O
partner	O
"	O
which	O
room	O
do	O
you	O
prefer	O
in	O
that	O
pricing	O
scheme	O
?	O
"	O
.	O
</s>
<s>
and	O
provide	O
popularized	O
explanations	O
of	O
the	O
Rental	B-Algorithm
Harmony	I-Algorithm
protocol	O
.	O
</s>
<s>
See	O
Rental	B-Algorithm
harmony	I-Algorithm
for	O
more	O
solutions	O
to	O
this	O
problem	O
.	O
</s>
<s>
The	O
Rental	B-Algorithm
Harmony	I-Algorithm
protocol	O
can	O
be	O
used	O
to	O
achieve	O
approximate	O
envy-free	O
assignment	O
of	O
chores	O
by	O
simply	O
thinking	O
of	O
the	O
rent	O
payments	O
as	O
chores	O
and	O
ignoring	O
the	O
rooms	O
.	O
</s>
