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

Abstract

About a symmetric three-players zero-sum game we will show the following results. 1. 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. 2. 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. If a zero-sum game is asymmetric, maximin strategies and minimax strategies of players do not correspond to Nash equilibrium strategies. If it is symmetric, the maximin strategies and the minimax strategies constitute a Nash equilibrium. However, without the coincidence of the maximin strategy and the minimax strategy there may exist an asymmetric equilibrium in a symmetric three-players zerosum game.

Chinese chess competition strategy analysis based on the zero-sum game

“…And also, Nash equilibrium could be used in a three-players Zero sum game. Mr. Satoh and Tanaka showed that without the coincidence of the maximin and minimax strategies, an asymmetric equilibrium in a symmetric three-player zero-sum game might exist [8]. Therefore, for points-based games, we can use zero-sum game theory and Nash equilibria to develop an excellent model for creating a better strategy for one of the parties.…”

Analysis of Robocode Robot Adaptive Confrontation Based on Zero-Sum Game

“…Zero-sum game is a concept of game theory, which is a non-cooperative game [1]. It means that the gain of one party must mean the loss of the other party, and the sum of gain and loss of each party is always "zero", and there is no possibility of cooperation between the two parties [2]- [5]. The result of a zero-sum game is that what one side gains is exactly what the other side loses, and the benefit to society as a whole does not increase by a single point.…”