Let $(U_{(1)},\dots,U_{(n)})$ be the first order statistic of $n$ i.i.d. uniform random variables in $(0,1)$. Let $(E_i)_i$ be $n$ i.i.d. exponential random variables of parameter 1, also independent from everything else.
Is it possible to write a formula for $\mathbb{P}(E_1 U_{(i)}\geq E_i U_{(1)}, \forall i\geq2)$? Is there a nice formula at least when $n$ goes to infinity?
I suspect you could do something like $$ \int_{x=0}^1 \int_{k=0}^\infty \left(\int_{y=x}^1 (1-e^{-yk/x}) \, dy\right)^{n-1} ne^{-k}\, dk \, dx $$ where $x$ is your $U_{(1)}$, $k$ is your $E_1$ and $y$ represents the higher values of $U_i$. I doubt this is easy to calculate beyond $n=2$ where it gives $\log_e(2) \approx 0.693$.
But I think simulation should work. The probability seems to reduce as $n$ increases, quickly getting below $0.56$ but never below $0.55$. Using R where the errors with a million simulations each should usually be smaller than $\pm 0.001$: