Speedup algorithm: Both error bounds and policy iterations

We consider following random model without labor:

for

and

where and are error terms with mean zero.

We also consider the following random model with labor:

We approximate the following random model with labor:

for the same random processes of Q and A. L is replaced by Lstar that is constant and

is computed from FOC with respect to labor.

We implement both error bounds and policy iterations in the same way as before

when we compute each policy function.