<s>
A	O
picking	B-Algorithm
sequence	I-Algorithm
is	O
a	O
protocol	O
for	O
fair	O
item	O
assignment	O
.	O
</s>
<s>
Some	O
possible	O
picking	B-Algorithm
sequences	I-Algorithm
are	O
:	O
</s>
<s>
How	O
should	O
the	O
picking	B-Algorithm
sequence	I-Algorithm
be	O
selected	O
?	O
</s>
<s>
A	O
possible	O
solution	O
to	O
this	O
problem	O
is	O
to	O
determine	O
a	O
picking	B-Algorithm
sequence	I-Algorithm
,	O
based	O
on	O
the	O
different	O
entitlements	O
,	O
and	O
let	O
each	O
party	O
pick	O
a	O
ministry	O
in	O
turn	O
.	O
</s>
<s>
This	O
means	O
that	O
,	O
at	O
each	O
point	O
in	O
the	O
picking	B-Algorithm
sequence	I-Algorithm
,	O
there	O
is	O
a	O
single	O
remaining	O
item	O
which	O
is	O
the	O
"	O
best	O
item	O
"	O
for	O
the	O
agent	O
.	O
</s>
<s>
Thus	O
,	O
the	O
picking	B-Algorithm
sequence	I-Algorithm
induces	O
a	O
sequential	O
game	O
and	O
it	O
is	O
interesting	O
to	O
analyze	O
its	O
subgame-perfect	O
equilibrium	O
.	O
</s>
<s>
Given	O
the	O
agents	O
 '	O
different	O
rights	O
,	O
what	O
would	O
be	O
a	O
fair	O
picking	B-Algorithm
sequence	I-Algorithm
?	O
</s>
<s>
Picking	B-Algorithm
sequences	I-Algorithm
can	O
be	O
used	O
to	O
find	O
allocations	O
that	O
satisfy	O
a	O
strong	O
fairness	O
and	O
efficiency	O
condition	O
called	O
competitive	O
equilibrium	O
.	O
</s>
