Completing a (k − 1)-Assignment

DOI10.1017/S0963548306008157zbMATH Open1142.90023arXivmath/0410347MaRDI QIDQ5437235FDOQ5437235

Johan Wästlund, Svante Linusson

Publication date: 18 January 2008

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Abstract: We consider the distribution of the value of the optimal k-assignment in an m 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.

Full work available at URL: https://arxiv.org/abs/math/0410347

zbMATH Keywords

Laplace transformexpected value

Mathematics Subject Classification ID

Stochastic programming (90C15)

Cited In (2)

• The Dyck bound in the concave 1-dimensional random assignment model
• Title not available (Why is that?)

   Recommendations

• Computing the sequence of \(k\)-cardinality assignments 👍 👎
• The \(k\)-assignment polytope 👍 👎
• The completion problem for \(N\)-matrices 👍 👎
• Title not available (Why is that?) 👍 👎
• The $k$ -Equal Problem 👍 👎
• Completion of \(S\)-posets 👍 👎
• The \(k\)-cardinality assignment problem 👍 👎
• The additive completion of \(k\)th powers 👍 👎
• The additive completion of \(k\)th-powers 👍 👎
• Schur analysis of some completion problems 👍 👎

This page was built for publication: Completing a (k − 1)-Assignment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5437235)