arXiv Analytics

Sign in

arXiv:1809.01488 [math.OC]AbstractReferencesReviewsResources

Sion's mini-max theorem and Nash equilibrium in a multi-players game with two groups which is zero-sum and symmetric in each group

Atsuhiro Satoh, Yasuhito Tanaka

Published 2018-09-04Version 1

We consider the relation between Sion's minimax theorem for a continuous function and a Nash equilibrium in a multi-players game with two groups which is zero-sum and symmetric in each group. We will show the following results. 1. The existence of Nash equilibrium which is symmetric in each group implies Sion's minimax theorem with the coincidence of the maximin strategy and the minimax strategy for players in each group. %given the values of the strategic variables. 2. Sion's minimax theorem with the coincidence of the maximin strategy and the minimax strategy for players in each group implies the existence of a Nash equilibrium which is symmetric in each group. Thus, they are equivalent. An example of such a game is a relative profit maximization game in each group under oligopoly with two groups such that firms in each group have the same cost functions and maximize their relative profits in each group, and the demand functions are symmetric for the firms in each group.

Related articles: Most relevant | Search more
arXiv:1706.08550 [math.OC] (Published 2017-06-26)
Semidefinite Programming and Nash Equilibria in Bimatrix Games
arXiv:1204.0852 [math.OC] (Published 2012-04-04, updated 2012-12-21)
Distributed convergence to Nash equilibria in two-network zero-sum games
arXiv:2411.12416 [math.OC] (Published 2024-11-19)
Nash Equilibria in Traffic Networks with Multiple Populations and Origins-Destinations