This paper studies the decoding of traceability codes though the lens of the Koetter-Vardy algebraic soft-decision decoding algorithm. Our focus is on the multiplicity assignment step. Previous works assumed that the cost of the multiplicity matrix had to approach infinity. We show that the cost of the multiplicity matrix can be polynomial in the code length in order to find identifiable traitors.