I am not sure how to construct a proof for something so obvious, can someone give me some pointers on proving the following
Suppose a constant K is added to each element of a pay-off matrix related to a game. What effect will it have on the solution?
(a) The optimal (security) strategies of the players and the value of the game remain unchanged.
(b) The optimal (security) strategies of the players do not change while the value of the game will increase by K.
(c) The optimal (security) strategies of the players as well as game value will all change.
So we have a payoff matrix $A$, we add a constant $k$ to each element $A$ yielding $A + K$. Our optimal value (value of the game) is $J^* \in A$, since $A$ is increased by $k$, therefore $J^*$ is increased by $k$.
Finally, our optimal (security) strategy for original payoff matrix $A$ is by choosing maximum payoff for player 1 when player 2 picks the lowest payoff, and choosing the lowest payoff (lowest cost) for player 2 when player 1 picks the maximum payoff. Since adding a constant does not change the well orderness of each row or column, therefore the security strategy remains the same as before.
Is there anything I could do to make more argument more rigorous for this intuitively obvious result?