Unbounded linear growth rate of assignment process is unacceptable

[0xAlcibiades]

We need to place an upper bound on the growth rate of the assignment process to make the protocol invulnerable to a "denial of service" attack vector on a given options type by spamming claims.

[0xAlcibiades]

The assignment algorithm needs to be modified to have a constant upper bound thus rendering it $O(constant)$