It seems like the consensus is to define an $\alpha$-competitive algorithm if $\mathbb{E}_R(ALG) \geq \alpha \mathbb{E}_R(OPT)$ where $\mathbb{E}_R$ is the expected value taken across the problem instances.
I am wondering why the more natural definition of $\mathbb{E}_R(\frac{ALG}{OPT})$ is not used instead.
The first definition allows an algorithm that does abysmally bad on almost all instances, but gets an extremely high value on un probable events. The second normalizes the approximation ratio across all realizations and is more "robust". Does the second metric have a name in the literature?