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

09/04/2018
by   Atsuhiro Satoh, et al.
0

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. 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.

READ FULL TEXT
research
09/09/2018

On zero-sum game formulation of non zero-sum game

We consider a formulation of a non zero-sum n players game by an n+1 pla...
research
06/19/2020

Learning Minimax Estimators via Online Learning

We consider the problem of designing minimax estimators for estimating t...
research
04/29/2022

Contests to Incentivize a Target Group

We study how to incentivize agents in a target group to produce a higher...
research
04/30/2012

A Game-Theoretic Model Motivated by the DARPA Network Challenge

In this paper we propose a game-theoretic model to analyze events simila...
research
09/07/2017

An Existence Theorem of Nash Equilibrium in Coq and Isabelle

Nash equilibrium (NE) is a central concept in game theory. Here we prove...
research
07/25/2018

Jamming in multiple independent Gaussian channels as a game

We study the problem of jamming in multiple independent Gaussian channel...
research
11/30/2017

Generalizing Gale's theorem on backward induction and domination of strategies

In 1953 Gale noticed that for every n-person game in extensive form with...

Please sign up or login with your details

Forgot password? Click here to reset