<s>
The	O
AL	B-Algorithm
procedure	I-Algorithm
is	O
a	O
procedure	O
for	O
fair	O
item	O
assignment	O
between	O
two	O
people	O
.	O
</s>
<s>
The	O
AL	B-Algorithm
procedure	I-Algorithm
was	O
first	O
published	O
by	O
Brams	O
and	O
Kilgour	O
and	O
Klamler	O
.	O
</s>
<s>
The	O
AL	B-Algorithm
procedure	I-Algorithm
requires	O
the	O
following	O
assumptions	O
on	O
the	O
people	O
:	O
</s>
<s>
The	O
AL	B-Algorithm
procedure	I-Algorithm
is	O
slightly	O
more	O
complicated	O
,	O
but	O
it	O
guarantees	O
that	O
the	O
contested	O
pile	O
is	O
never	O
larger	O
,	O
and	O
may	O
be	O
smaller	O
than	O
under	O
BT	O
.	O
</s>
<s>
The	O
AL	B-Algorithm
procedure	I-Algorithm
works	O
similarly	O
to	O
the	O
BT	O
procedure	O
,	O
but	O
,	O
before	O
moving	O
an	O
item	O
to	O
the	O
contested	O
pile	O
,	O
it	O
tries	O
to	O
allocate	O
it	O
to	O
one	O
partner	O
while	O
compensating	O
the	O
other	O
partner	O
with	O
another	O
item	O
.	O
</s>
<s>
The	O
AL	B-Algorithm
procedure	I-Algorithm
also	O
starts	O
by	O
giving	O
1	O
to	O
Alice	O
and	O
2	O
to	O
George	O
.	O
</s>
<s>
The	O
original	O
AL	B-Algorithm
procedure	I-Algorithm
crucially	O
relies	O
on	O
the	O
assumption	O
that	O
the	O
item	O
rankings	O
are	O
strict	O
.	O
</s>
