<s>
Adjusted	B-Algorithm
Winner	I-Algorithm
(	O
AW	O
)	O
is	O
a	O
procedure	O
for	O
envy-free	O
item	O
allocation	O
.	O
</s>
<s>
For	O
two	O
agents	O
,	O
Adjusted	B-Algorithm
Winner	I-Algorithm
is	O
the	O
only	O
Pareto	O
optimal	O
and	O
equitable	O
procedure	O
that	O
divides	O
at	O
most	O
a	O
single	O
good	O
.	O
</s>
<s>
PO+EQ	O
allocations	O
can	O
be	O
found	O
by	O
linear	B-Algorithm
programming	I-Algorithm
.	O
</s>
<s>
The	O
Brams	B-Algorithm
–	I-Algorithm
Taylor	I-Algorithm
procedure	I-Algorithm
was	O
designed	O
by	O
the	O
same	O
authors	O
,	O
but	O
it	O
is	O
different	O
it	O
is	O
a	O
procedure	O
for	O
envy-free	O
cake-cutting	O
.	O
</s>
