and proposed a greedy method giving random permutation at which the permutation process attains the value asymptotically equivalent to the expectation of maximum.
Essentially the same results for Gaussian case were obtained independently by
the authors [1]} who also used the greedy method but the priority of [2]} in its preprint version must be of course acknowledged here. In their preprint, Cheng et al. [3]} considered assignment processes on more general graph structures and more general random
variables satisfying some special assumptions.
