This paper provides a theorem to compare the minimum total cost of two different Euclidean Random Assignment Problems with the same number of points, using the stochastic order of the costs of one of the pairs in these two problems. The subsequent sections provide two applications of the theorem, including studies of the problem on the one-dimensional $k$-star graph and comparisons between some problems in higher dimensions. More possible applications and limitations of the theorem are also discussed.