A Proof of Parisi's Conjecture on the Random Assignment Problem

Simple item page
dc.creatorLinusson, Svante
dc.creatorWaestlund, Johan
dc.date2003-03-18
dc.date.accessioned2026-07-07T04:56:08Z
dc.date.available2026-07-07T04:56:08Z
dc.descriptionAn 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/k^2 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.
dc.identifierhttps://arxiv.org/abs/math/0303214
dc.identifierhttp://arxiv.org/abs/math/0303214
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/66817
dc.subjectCombinatorics
dc.subjectMathematical Physics
dc.subjectProbability
dc.titleA Proof of Parisi's Conjecture on the Random Assignment Problem
dc.typetext

Files

Collections

arXiv