Completing a (k-1)-assignment
2007 (English)In: Combinatorics, probability & computing, ISSN 0963-5483, E-ISSN 1469-2163, Vol. 16, no 4, 621-629 p.Article in journal (Refereed) Published
We consider the distribution of the value of the optimal k-assignment in an in x n matrix, where the entries are independent exponential random variables with arbitrary rates. We give closed formulas for both the Laplace transform of this random variable and for its expected value under the condition that there is a zero-cost (k - 1)-assignment.
Place, publisher, year, edition, pages
2007. Vol. 16, no 4, 621-629 p.
random assignment problem, minimum assignment, exact expectations, expected value, conjecture, proof
IdentifiersURN: urn:nbn:se:kth:diva-16772DOI: 10.1017/s0963548306008157ISI: 000247845900006ScopusID: 2-s2.0-34249980693OAI: oai:DiVA.org:kth-16772DiVA: diva2:334815
QC 201005252010-08-052010-08-05Bibliographically approved