Abstract
Consider the random assignment (or bipartite matching) problem with iid uniform edge costs t(i, j). Let be the optimal assignment cost. Just recently does Aldous [2] give a rigorous proof that E longrightarrowζ(2). In this paper we establish the upper and lower bounds for Var , i.e., there exist two strictly positive but finite constants and such athat 2)/ (log n)2)/ Var (log n).EX>.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
