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 条
  • [31] A differential game of N persons in which there is Pareto equilibrium of objections and counterobjections and no Nash equilibrium
    Zhukovskii, V. I.
    Mukhina, Yu. S.
    Romanova, V. E.
    IZVESTIYA INSTITUTA MATEMATIKI I INFORMATIKI-UDMURTSKOGO GOSUDARSTVENNOGO UNIVERSITETA, 2021, 57 : 104 - 127
  • [32] Nash equilibrium in the game of transmission expansion - Part one: Pure strategy Nash equilibrium
    Wang, Chengshan
    Ji, Xingquan
    2002, Automation of Electric Power Systems Press (26):
  • [33] Optimal Dispatch of Multi-stakeholder Based on Pareto-Nash Equilibrium Game for Active Distribution Network
    Lu, Jinling
    Wei, Yuxing
    Yang, Hang
    Huang, Jinpeng
    Wang, Fei
    2019 IEEE INDUSTRY APPLICATIONS SOCIETY ANNUAL MEETING, 2019,
  • [34] An efficient method of Pareto-optimal front generation for analog circuits
    Kundu, Sudip
    Mandal, Pradip
    ANALOG INTEGRATED CIRCUITS AND SIGNAL PROCESSING, 2018, 94 (02) : 289 - 316
  • [35] GRS method for Pareto-optimal front identification in electromagnetic synthesis
    Farina, M
    Bramanti, A
    Di Barba, P
    IEE PROCEEDINGS-SCIENCE MEASUREMENT AND TECHNOLOGY, 2002, 149 (05) : 207 - 213
  • [36] An efficient method of Pareto-optimal front generation for analog circuits
    Sudip Kundu
    Pradip Mandal
    Analog Integrated Circuits and Signal Processing, 2018, 94 : 289 - 316
  • [37] Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods
    Garg, Jugal
    Murhekar, Aniket
    Journal of Artificial Intelligence Research, 2024, 80 : 1 - 25
  • [38] Computing Pareto-Optimal and Almost Envy-Free Allocations of Indivisible Goods
    Garg, Jugal
    Murhekar, Aniket
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2024, 80 : 1 - 25
  • [39] A general method and improvement for computing the solutions of the bimatrix game using matlab
    Guo, Lei
    Gao, Zuofeng
    Li, Cuili
    Ma, Ying
    Su, Weiwei
    Proceedings of the Second International Conference on Game Theory and Applications, 2007, : 53 - 56
  • [40] COALITIONAL PARETO OPTIMAL SOLUTION OF ONE DIFFERENTIAL GAME
    Zhukovskiy, V. I.
    Zhukovskaya, L. V.
    Sachkov, S. N.
    Sachkova, E. N.
    IZVESTIYA INSTITUTA MATEMATIKI I INFORMATIKI-UDMURTSKOGO GOSUDARSTVENNOGO UNIVERSITETA, 2024, 63 : 18 - 36
12345