First, we note that a difficulty of Problem (RC fair ) is the discontinuity of its objective function.
we show that (RC fair ) can be formulated equivalently as a two-stage robust optimization problem by introducing a fictitious counting phase after e  is revealed.