On the maximum of a special random assignment process
Teoriâ veroâtnostej i ee primeneniâ, Tome 67 (2022) no. 4, pp. 802-809
Voir la notice de l'article provenant de la source Math-Net.Ru
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
this expectation depends on the coefficients' distribution.
Keywords:
asymptotic behavior, maximization, assignment process.
Mots-clés : bipartite graph
Mots-clés : bipartite graph
@article{TVP_2022_67_4_a8,
author = {M. A. Lifshits and A. A. Tadevosyan},
title = {On the maximum of a special random assignment process},
journal = {Teori\^a vero\^atnostej i ee primeneni\^a},
pages = {802--809},
publisher = {mathdoc},
volume = {67},
number = {4},
year = {2022},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TVP_2022_67_4_a8/}
}
M. A. Lifshits; A. A. Tadevosyan. On the maximum of a special random assignment process. Teoriâ veroâtnostej i ee primeneniâ, Tome 67 (2022) no. 4, pp. 802-809. http://geodesic.mathdoc.fr/item/TVP_2022_67_4_a8/