{ "id": "math/0004175", "version": "v2", "published": "2000-04-27T20:31:58.000Z", "updated": "2000-05-12T00:59:11.000Z", "title": "On the expected value of the minimum assignment", "authors": [ "Marshall W. Buck", "Clara S. Chan", "David P. Robbins" ], "comment": "40 pages, New version updates reference, corrects typos, and contains minor improvements of some results", "categories": [ "math.CO", "math.PR" ], "abstract": "The minimum k-assignment of an m by n matrix X is the minimum sum of k entries of X, no two of which belong to the same row or column. If X is generated by choosing each entry independently from the exponential distribution with mean 1, then Coppersmith and Sorkin conjectured that the expected value of its minimum k-assignment is \\sum_{i,j \\ge 0, i+j