On the maximum of random assignment process
From MaRDI portal
Publication:2670804
DOI10.1016/J.SPL.2022.109530zbMATH Open1487.60015arXiv2201.11390OpenAlexW4229077461WikidataQ114130460 ScholiaQ114130460MaRDI QIDQ2670804FDOQ2670804
Authors: A. A. Tadevosian, M. A. Lifshits
Publication date: 1 June 2022
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Abstract: We describe the behavior of the expectation of the maximum for a random assignment process built upon a square matrix with independent entries. Under mild assumptions on the underlying distribution, the answer is expressed in terms of its quantile function.
Full work available at URL: https://arxiv.org/abs/2201.11390
Recommendations
- On the Maximum of a Special Random Assignment Process
- Maxima and near-maxima of a Gaussian random assignment field
- On the expected number of assignments in reduced matrices for the linear assignment problem
- Certain expected values in the random assignment problem
- Asymptotics in the random assignment problem
Combinatorial optimization (90C27) Combinatorial probability (60C05) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The \(\zeta(2)\) limit in the random assignment problem
- Title not available (Why is that?)
- Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures
- Title not available (Why is that?)
- An easy proof of the \(\zeta (2)\) limit in the random assignment problem
- Asymptotics in the random assignment problem
- Title not available (Why is that?)
- 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
- Maxima and near-maxima of a Gaussian random assignment field
Cited In (5)
This page was built for publication: On the maximum of random assignment process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2670804)