Sion's minimax theorem and Nash equilibrium of symmetric three-players zero-sum game (Q2214197)

Summary: About a symmetric three-players zero-sum game we will show the following results. A modified version of Sion's minimax theorem with the coincidence of the maximin strategy and the minimax strategy are proved by the existence of a symmetric Nash equilibrium. The existence of a symmetric Nash equilibrium is proved by the modified version of Sion's minimax theorem with the coincidence of the maximin strategy and the minimax strategy. Thus, they are equivalent. However, without the coincidence of the maximin strategy and the minimax strategy there may exist an asymmetric equilibrium in a symmetric three-players zero-sum game.