D. Aldous, Asymptotics in the random assignment problem, Probability Theory and Related Fields, vol.8, issue.4, pp.507-534, 1992.
DOI : 10.1007/BF01192719

D. Aldous and J. M. Steele, The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence, Probability on discrete structures, pp.1-72, 2004.
DOI : 10.1007/978-3-662-09444-0_1

J. David and . Aldous, The ?(2) limit in the random assignment problem, Random Structures Algorithms, vol.18, issue.4, pp.381-418, 2001.

J. David, A. Aldous, and . Bandyopadhyay, A survey of max-type recursive distributional equations, Ann. Appl. Probab, vol.15, issue.2, pp.1047-1110, 2005.

D. Gamarnik, T. Nowicki, and G. Swirszcz, Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method. Random Structures Algorithms, pp.76-106, 2006.

M. Khandwawala, Solutions to recursive distributional equations for the mean-field TSP and related problems. ArXiv e-prints, 2014.

A. N. Kolmogorov and S. V. Fom¯-in, Introductory real analysis Translated from the second Russian edition, 1975.

J. Larsson, The Minimum Perfect Matching in Pseudo-dimension 0<q<1. ArXiv e-prints, 2014.

S. Linusson and J. Wästlund, A proof of Parisi?s conjecture on the random assignment problem, Probability Theory and Related Fields, vol.128, issue.3, pp.419-440, 2004.
DOI : 10.1007/s00440-003-0308-9

M. Mézard and G. Parisi, Replicas and optimization, Journal de Physique Lettres, vol.46, issue.17, pp.771-778, 1985.
DOI : 10.1051/jphyslet:019850046017077100

M. Mézard and G. Parisi, Mean-Field Equations for the Matching and the Travelling Salesman Problems, Europhysics Letters (EPL), vol.2, issue.12, p.913, 1986.
DOI : 10.1209/0295-5075/2/12/005

M. Mézard and G. Parisi, On the solution of the random link matching problems, Journal de Physique, vol.48, issue.9, pp.1451-1459, 1987.
DOI : 10.1051/jphys:019870048090145100

C. Nair, B. Prabhakar, and M. Sharma, Proofs of the Parisi and Coppersmith-Sorkin random assignment conjectures. Random Structures Algorithms, pp.413-444, 2005.

G. Parisi and J. Wästlund, Mean field matching and traveling salesman problems in pseudo-dimension 1, 2012.

J. Wästlund, An easy proof of the $\zeta(2)$ limit in the random assignment problem, Electronic Communications in Probability, vol.14, issue.0, pp.261-269, 2009.
DOI : 10.1214/ECP.v14-1475

J. Wästlund, Replica symmetry of the minimum matching, Annals of Mathematics, vol.175, issue.3, pp.1061-1091, 2012.
DOI : 10.4007/annals.2012.175.3.2