Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
  1. Home
  2. Probability Theory and Related Fields
  3. Article
Asymptotics in the random assignment problem
Download PDF
Download PDF
  • Published: December 1992

Asymptotics in the random assignment problem

  • David Aldous1 

Probability Theory and Related Fields volume 93, pages 507–534 (1992)Cite this article

  • 393 Accesses

  • 82 Citations

  • Metrics details

Summary

We show that, in the usual probabilistic model for the random assignment problem, the optimal cost tends to a limit constant in probability and in expectation. The method involves construction of an infinite limit structure, in terms of which the limit constant is defined. But we cannot improve on the known numerical bounds for the limit.

Download to read the full article text

Working on a manuscript?

Avoid the common mistakes

References

  1. Aldous, D.J.: The continuum random tree II: an overview. In: Barlow, M.T., Bingham, N.H. (eds.) Proc. Durham Symp. Stochastic Analysis 1990. Cambridge: University Press 1992

    Google Scholar 

  2. Aldous, D.J.: A random tree model associated with random graphs. Random Structures Algorithms1, 383–402 (1990)

    Google Scholar 

  3. Aldous, D.J., Steele, J.M., Asymptotics for Euclidean minimal spanning trees on random points. Probab. Theory Relat. Fields92, 247–258 (1992)

    Google Scholar 

  4. Dyer, M.E., Frieze, A.M., Mac Diarmid, C.J.H.: On linear programs with random costs. Math. Program.35, 3–16 (1986)

    Google Scholar 

  5. Goemans, M.X., Kodialam, M.S.: A lower bound on the expected cost of an optimal assignment. Technical Report, Operations Res. MIT (1989)

  6. Jagers, P., Nerman, O.: The growth and composition of branching processes. Adv. Appl. Probab.16, 221–259 (1984)

    Google Scholar 

  7. Karp, R.M.: An upper bound on the expected cost of an optimal assignment. In: Johnson, D.S. et al. (eds.) Discrete algorithms and complexity: Proceedings of the Japan-U.S. Joint Seminar, pp. 1–4. New York: Academic Press 1987

    Google Scholar 

  8. Mezard, M., Parisi, G.: On the solution of the random link matching problem. J. Phys. (Paris)48, 1451–1459 (1987)

    Google Scholar 

  9. Nerman, O., Jagers, P.: The stable doubly infinite pedigree process of supercritical branching populations. Z. Wahrscheinlichkeitstheor. Verw. Geb.65, 445–460 (1984)

    Google Scholar 

  10. Rhee, W.T., Talagrand, M.: Martingale inequalities, interpolation and NP-complete problems. Math. Oper. Res.14, 91–96 (1989)

    Google Scholar 

  11. Steele, J.M.: Probability and statistics in the service of computer science: illustrations using the assignment problem. Commun. Stat., Theory Methods19, 4315–4329 (1990)

    Google Scholar 

  12. Walkup, D.W.: Matchings in random regular bipartite digraphs. Discrete Math.31, 59–64 (1980)

    Google Scholar 

  13. Walkup, D.W.: On the expected value of a random assignment problem. SIAM J. Comput.8, 440–442 (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics, University of California, 94720, Berkeley, CA, USA

    David Aldous

Authors
  1. David Aldous
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported by NSF Grant MCS90-01710

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Aldous, D. Asymptotics in the random assignment problem. Probab. Th. Rel. Fields 93, 507–534 (1992). https://doi.org/10.1007/BF01192719

Download citation

  • Received: 17 October 1991

  • Revised: 24 March 1992

  • Issue Date: December 1992

  • DOI: https://doi.org/10.1007/BF01192719

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Mathematics Subject Classification

  • 60C05
Download PDF

Working on a manuscript?

Avoid the common mistakes

Advertisement

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature