On the Properties of the Maximum of a Random Assignment Process

We study the maximum of the random assignment process on rectangular matrices. We derive first-order asymptotics for the expected maximum, prove a law of large numbers under mild tail assumptions, and obtain exponential upper bounds for the probabilities of large deviations.