Resource title

Exact expectations and distributions for the random assignment problem

Resource image

image for OpenScout resource :: Exact expectations and distributions for the random assignment problem

Resource description

A generalization of the random assignment problem asks the expected cost of the minimum-cost matching of cardinality k in a complete bipartite graph Km,n, with independent random edge weights. With weights drawn from the exponential distribution with intensity 1, the answer has been conjectured to be Σi,j[greater-than-or-equal]0, i+j

Resource author

Resource publisher

Resource publish date

Resource language

en

Resource content type

Resource resource URL

http://eprints.lse.ac.uk/35494/

Resource license