One Method for Computing the Pareto-Optimal Nash Equilibrium in Bimatrix Game

被引：0
|
作者：
Kudryavtsev, Konstantin [1 ]
Zhukovskiy, Vladislav [2 ]
Stabulit, Irina [3 ]
机构：
[1] South Ural State Univ, Chelyabinsk, Russia
[2] Moscow MV Lomonosov State Univ, Moscow, Russia
[3] Chelyabinsk State Univ, Chelyabinsk, Russia
来源：
2017 CONSTRUCTIVE NONSMOOTH ANALYSIS AND RELATED TOPICS (DEDICATED TO THE MEMORY OF V.F. DEMYANOV) (CNSA) | 2017年
关键词：
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper we propose a new method of searching a Pareto optimal Nash Equilibrium in a bimatrix game. These method employ the Germeier convolutions of the payoff functions.
引用
收藏
页码：175 / 177
页数：3
相关论文
共 50 条
12345