Article contents
Completing a (k − 1)-Assignment
Published online by Cambridge University Press: 01 July 2007
Abstract
We consider the distribution of the value of the optimal k-assignment in an m × 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.
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2007
References
- 1
- Cited by