On definability of order in logic with choice

We will answer questions due to Blass and Gurevich (2000) on definability of order in the first-order logic with Hilbert's epsilon operation. We show that a linear ordering is almost surely definable in models with random choice.