A proof of Parisi’s conjecture on the random assignment problem

Abstract.An assignment problem is the optimization problem of finding, 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 matrix entries are random variables. We give a formula for the expected value of the optimal k-assignment in a matrix where some of the entries are zero, and all other entries are independent exponentially distributed random variables with mean 1. Thereby we prove the formula 1+1/4+1/9+\...+1/k2 conjectured by G. Parisi for the case k=m=n, and the generalized conjecture of D. Coppersmith and G. B. Sorkin for arbitrary k, m and n.

[1]  W. Donath.  Algorithm and average-value bounds for assignment problems , 1969 .

[2]  David W. Walkup,et al.  On the Expected Value of a Random Assignment Problem , 1979, SIAM J. Comput..

[3]  Alan M. Frieze,et al.  On the value of a random minimum spanning tree problem , 1985, Discret. Appl. Math..

[4]  M. Mézard,et al.  Replicas and optimization , 1985 .

[5]  M. Mézard,et al.  On the solution of the random link matching problems , 1987 .

[6]  R. Karp.  An Upper Bound on the Expected Cost of an Optimal Assignment , 1987 .

[7]  D. Aldous.  Asymptotics in the random assignment problem , 1992 .

[8]  Michel X. Goemans,et al.  A Lower Bound on the Expected Cost of an Optimal Assignment , 1993, Math. Oper. Res..

[9]  Andrew J. Lazarus,et al.  Certain expected values in the random assignment problem , 1993, Oper. Res. Lett..

[10]  Panos M. Pardalos,et al.  On the expected optimal value of random assignment problems: Experimental results and open questions , 1993, Comput. Optim. Appl..

[11]  G. Parisi.  A Conjecture on random bipartite matching , 1998, cond-mat/9801176.

[12]  Alan M. Frieze,et al.  Random Minimum Length Spanning Trees in Regular Graphs , 1998, Comb..

[13]  Don Coppersmith,et al.  Constructive bounds and exact expectations for the random assignment problem , 1998, Random Struct. Algorithms.

[14]  D. Coppersmith,et al.  Constructive bounds and exact expectation for the random assignment problem , 1999 .

[15]  Svante Linusson,et al.  A Generalization of the Random Assignment Problem , 2000, math/0006146.

[16]  David P. Robbins,et al.  On the expected value of the minimum assignment , 2002, Random Struct. Algorithms.

[17]  Chandra Nair.  Towards the Resolution of Coppersmith-Sorkin Conjectures , 2002 .

[18]  Sven Erick Alm,et al.  Exact Expectations And Distributions For The Random Assignment Problem , 2002, Comb. Probab. Comput..

[19]  D. Coppersmith,et al.  On the expected incremental cost of a minimum assignment , 2002 .

[20]  B. Prabhakar,et al.  A Proof of the Conjecture due to Parisi for the Finite Random Assignment Problem , 2003 .

[21]  Henrik Eriksson,et al.  Exact Expectations for Random Graphs and Assignments , 2003, Comb. Probab. Comput..

[22]  Mayank Sharma,et al.  Proofs of the Parisi and Coppersmith-Sorkin conjectures for the finite random assignment problem , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..