Answers are grounded in this paper and cite their sources.
Given an n by n matrix X, the assignment problem asks for a set of n entries, one from each column and row, with the minimum sum. It is shown that the expected value of this minimum sum is less than 3, independent of n, if X consists of independent random variables uniformly distributed from 0 to 1.
No takes yet. Share an insight, caveat, or question.
David W. Walkup (1979) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: