Random Assignment with Integer Costs

DOI10.1017/S0963548303005819MaRDI QIDQ4813869zbMATH OpenFDO

Authors Robert Parviainen

Publication date 7 September 2004

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

zbMATH Keywords

random assignmentcoupling argumentsinteger cost

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial probability (60C05)

Recommendations

• Asymptotics in the random assignment problem
• ON THE FLUCTUATION IN THE RANDOM ASSIGNMENT PROBLEM
• Constructive bounds and exact expectations for the random assignment problem
• Certain expected values in the random assignment problem
• The \(\zeta(2)\) limit in the random assignment problem

Cited in

(6)

• (Non-)obvious manipulability of rank-minimizing mechanisms
• Rounding of continuous random variables and oscillatory asymptotics
• Random assignment problems
• Extrema of a multinomial assignment process
• Uncertain random assignment problem
• The cost of strategy-proofness in school choice

This page was built for publication: Random Assignment with Integer Costs

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