2 problems

Finite-termination conjecture. If $\pi^*$ is unique, then the min-sum auction I algorithm terminates after finitely many iterations when this condition is removed from step (4).

Initial-discrepancy conjecture. If all the discrepancies $r_{ij}$ are initially bounded by a small multiple of $\epsilon$, then the path produced by the algorithm upon termination…