两组对称零和五人对策的Sion极大极小定理与纳什均衡
Sion's mini-max theorem and Nash equilibrium in a five-players game with two groups which is zero-sum and symmetric in each group
摘要:
本文研究了连续函数的Sion极大极小定理与两组零和对称的五人对策的纳什均衡之间的关系。我们将展示以下结果。1.每个群中对称的纳什均衡的存在性意味着每个群中一对博弈的Sion极大极小定理。2. Sion的极大极小定理,在每个组中的一对播放意味着存在一个纳什均衡,这是对称的每个组。因此,它们是等同的。这种博弈的一个例子是在寡头垄断下的两个群体中每个群体的相对利润最大化博弈,每个群体中的企业具有相同的成本函数,并使每个群体中的相对利润最大化,并且每个群体中的企业的需求函数是对称的。
英文摘要:
We consider the relation between Sion's minimax theorem for a continuous function and a Nash equilibrium in a five-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 for a pair of playes in each group. 2. Sion's minimax theorem for a pair of playes in each group imply 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。