On the maximum of a special random assignment process
Mikhail Lifshits, Arman Tadevosian
TL;DR
This paper investigates the asymptotic expectation of the maximum in a specific random assignment process, analyzing how it varies with the distribution of the coefficients involved.
Contribution
It provides a detailed analysis of the maximum's behavior in a special assignment process, highlighting the influence of coefficient distributions.
Findings
Expectation of the maximum depends on the coefficients' distribution.
Asymptotic behavior characterized for different coefficient types.
Results applicable to related assignment and optimization problems.
Abstract
We consider the asymptotic behavior of the expectation of the maximum for a special assignment process with constant or i.i.d. coefficients. We show how it depends on the coefficients' distribution.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods · Mathematical Dynamics and Fractals