A proof of Parisi’s conjecture on the random assignment problem, Probab. Theory Relat. Fie.pdfVIP

a r X i v : m a t h / 0 3 0 3 2 1 4 v 1 [ m a t h .C O ] 1 8 M a r 2 0 0 3 A PROOF OF PARISI’S CONJECTURE ON THE RANDOM ASSIGNMENT PROBLEM SVANTE LINUSSON AND JOHAN WA?STLUND Abstract. An assignment problem is the optimization problem of find- ing, in an m by n matrix of nonnegative real numbers, k entries, no two in the same row or column, such that their sum is minimal. Such an optimization problem is called a random assignment problem if the ma- trix entries are random variables. We give a formula for the expected value of the optimal k-assignment in a matrix where some of the en- t