With this notation, combining ( 8 ) and ( 9 ), a closed-loop notion of “distance” between X and X ^ can be computed as an equilibrium point to the following Min-Max (or Max-Min) program for the same utility in terms of rate reduction (theoretically, there might be significant difference in formulating and seeking the desired solution as the equilibrium point to a min-max or max-min game.
1
—
—