On the maximum of random assignment process
From MaRDI portal
Publication:2670804
DOI10.1016/j.spl.2022.109530zbMath1487.60015arXiv2201.11390OpenAlexW4229077461WikidataQ114130460 ScholiaQ114130460MaRDI QIDQ2670804
A. A. Tadevosian, Mikhail Lifshits
Publication date: 1 June 2022
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.11390
Combinatorial optimization (90C27) Combinatorial probability (60C05) Discrete location and assignment (90B80)
Related Items (3)
On the Maximum of a Special Random Assignment Process ⋮ Extrema of a multinomial assignment process ⋮ Typical values of extremal-weight combinatorial structures with independent symmetric weights
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An easy proof of the \(\zeta (2)\) limit in the random assignment problem
- Asymptotics in the random assignment problem
- Maxima and near-maxima of a Gaussian random assignment field
- The ?(2) limit in the random assignment problem
- On the expected value of the minimum assignment
- Constructive bounds and exact expectations for the random assignment problem
- Exact solution of the random bipartite matching model
- Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures
This page was built for publication: On the maximum of random assignment process