Change search
ReferencesLink to record
Permanent link

Direct link
Completing a (k-1)-assignment
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Mathematics (Div.).ORCID iD: 0000-0001-6339-2230
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
Abstract [en]

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.
Keyword [en]
random assignment problem, minimum assignment, exact expectations, expected value, conjecture, proof
URN: urn:nbn:se:kth:diva-16772DOI: 10.1017/s0963548306008157ISI: 000247845900006ScopusID: 2-s2.0-34249980693OAI: diva2:334815
QC 20100525Available from: 2010-08-05 Created: 2010-08-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Linusson, Svante
By organisation
Mathematics (Div.)
In the same journal
Combinatorics, probability & computing

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 16 hits
ReferencesLink to record
Permanent link

Direct link