Exact expectations and distributions for the random assignment problem

Combinatorics Probability and Computing

Volumn 11, Issue 3, 2002, Pages 217-248

  Alm, Sven Erick ^a   Sorkin, Gregory B ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; GRAPH THEORY; LAPLACE TRANSFORMS; PROBABILITY DISTRIBUTIONS;

EXACT EXPECTATIONS; EXPONENTIAL DISTRIBUTIONS; RANDOM ASSIGNMENT PROBLEM;

RANDOM PROCESSES;

EID: 0036016669     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548302005114     Document Type: Article

References (23)

1. Aldous, D. (2000) The ζ(2) limit in the random assignment problem. Random. Struct. Alg. 18 381-418.
2. Alm, S. E. and Sorkin, G. B. (1999) Exact expectations and distributions for the random assignment problem. Technical Report 1999:27, University of Uppsala Department of Mathematics Report, Uppsala, Sweden. Accessible at http://www.math.uu.se/~sea/assign.ps.
3. Alon, N. and Spencer, J. H. (1992) The Probabilistic Method, Wiley.
4. Beveridge, A., Frieze, A. and McDiarmid, C. (1998) Random minimum length spanning trees in regular graphs. Combinatorica 18 311-333.
5. Buck, M. W., Chan, C. S. and Robbins, D. P. (2000) On the expected value of the minimum assignment. Mathematics arXiv, http://arxiv.org/ps/math/0004175v2.
6. Coppersmith, D. and Sorkin, G. B. (2002) On the expected incremental cost of a minimum assignment. In Contemporary Mathematics (B. Bollobás, ed.), Vol. 10 of Bolyai Society Mathematical Studies, Springer. To appear.
7. Coppersmith, D. and Sorkin, G. B. (1999) Constructive bounds and exact expectations for the random assignment problem. Random Struct. Alg. 15 133-144.
8. Dyer, M. E., Frieze, A. M. and McDiarmid, C. J. H. (1986) On linear programs with random costs. Mathematical Programming 35 3-16.
9. Feller, W. (1971) An Introduction to Probability Theory and its Applications, Vol. 2, 2nd edn, Wiley, New York.
10. Frieze, A. M. (1985) On the value of a random minimum spanning tree problem. Discrete Appl. Math. 10 47-56.
11. Frieze, A. M. and McDiarmid, C. J. H. (1989) On random minimum length spanning trees. Combinatorica 9 363-374.
12. Janson, S. (1999) Personal communication.
13. Karp, R. M. (1987) An upper bound on the expected cost of an optimal assignment. In Discrete Algorithms and Complexity: Proc. Japan-US Joint Seminar (D. S. Johnson et al., eds), Vol. 15 of Perspectives in Computing, Academic Press, pp. 1-4.
14. Lazarus, A. J. (1979) The assignment problem with uniform (0,1) cost matrix. Master's thesis, Department of Mathematics, Princeton University, Princeton, NJ.
15. Lazarus, A. J. (1993) Certain expected values in the random assignment problem. Oper. Res. Lett. 14 207-214.
16. Linusson, S. and Wästlund, J. (2000) A generalization of the random assignment problem. Mathematics arXiv, http://arxiv.org/ps/math/0006146.
17. McKay, B. D. (1978) Computing automorphisms and canonical labellings of graphs. Combinatorial Mathematics 686 223-232. See also http://cs.anu.edu.au/~bdm/.
18. Mézard, M. and Parisi, G. (1985) Replicas and optimization. J. Physique Lettres 46 771-778.
19. Mézard, M. and Parisi, G. (1987) On the solution of the random link matching problems. J. Physique Lettres 48 1451-1459.
20. Olin, B. (1992) Asymptotic properties of random assignment problems. PhD thesis, Kungl. Tekniska Högskolan, Stockholm, Sweden.
21. Pardalos, P. M. and Ramakrishnan, K. G. (1993) On the expected optimal value of random assignment problems: Experimental results and open questions. Comput. Optim. Appl. 2 261-271.
22. Parisi, G. (1998) A conjecture on random bipartite matching. Physics e-Print archive: http://xxx.lanl.gov/ps/cond-mat/9801176.
23. Talagrand, M. (1995) Concentration of measure and isoperimetric inequalities in product spaces. Inst. Hautes Études Sci. Publ. Math. 81 73-205.