ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Fk(m,n)F_k(m,n) denote the expected cost of an optimal kk-assignment in an m×nm\times n matrix of independent exponentially distributed random variables with mean 11. Here a kk-assignment is a set of kk entries with no two in the same row or column. Coppersmith–Sorkin conjecture.

Fk(m,n)=∑i,j≥0i+j<k1(m−i)(n−j).F_k(m,n)=\sum_{\substack{i,j\geq 0\\ i+j<k}}\frac{1}{(m-i)(n-j)}.

The source says this conjecture was verified for k≤6k\leq 6 for arbitrary mm and nn, but gives no general proof.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.