A simulation of the non-cooperative Nash equilibrium model

被引:0
|
作者
Maki, A [1 ]
机构
[1] Keio Univ, Fac Sci & Technol, Kanagawa, Japan
关键词
non-cooperative Nash equilibrium; replicator dynamic; conjectural variation;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The present analysis is an application of the continuous time replicator dynamic to a market equilibrium model. Let us consider that there are two automobile corporations that make two types of automobiles, namely deluxe and ordinary cars. Each corporation has its own production limits for these two types of automobiles, and each produces two types of automobiles so as to maximize profits, calculated to include conjectural variations between the two firms. Let us define x(i)(P) as the quantity of automobiles for corporation p (p=1,2) and type i (i=1,2). The non-cooperative Nash equilibrium solution is obtained after assuming the profit maximization behavior for each corporation under the conditions of normalized constraints as : x(1)(1)+x(2)(1)=1 and x(1)(2) +x(2)(2)= 1 and non-negative constraints, x(i)(P) greater than or equal to 0 (p,i=1,2). To get the Nash equilibrium point, the profit function of corporation p is specified as : E-P(x(1),x(2))=Sigmaf(i)(p))-SigmaSigmatheta(ij)(p)x(j)(p)x(j)(q) (p=1,2,i,j=1,2(i#j,p#q)), where theta(ij)(p) is the conjectural variations. The replicator dynamic for corporation 1 is specified as : dx(1)(1)(t)/dt=x(1)(1)(t)x(2)(1)(t){df(1)(1)(x(1)(1)(t)/dx(1)(1)-df(2)(1)(x(2)(1)(t))/dx(2)(1)-Sigma(theta(1j)(1)-theta(2j)(1))x(j)(2)} and dx(2)(1)(t)/dt= x(1)(1)(t)x(2)(1)(t) {df(2)(1)(X-2(1)(t) /dX(2)(1)-df(1)(1)(x(1)(1)(t))/dx(1)(1)-Sigma(theta(2j)(1)-theta(1j)(1))x(j)(2)}. Changes in the values of theta(ij)(P) and the parameters included in the profit functions make possible many alternative production mixes between deluxe and ordinary cars for the two corporations.
引用
收藏
页码:1487 / 1492
页数:6
相关论文
共 50 条
  • [31] NON-COOPERATIVE EQUILIBRIUM WITH PRICE DISCRIMINATING FIRMS
    SPULBER, DF
    [J]. ECONOMICS LETTERS, 1979, 4 (03) : 221 - 227
  • [32] Nash Equilibrium Approximation under Communication and Computation Constraints in Large-Scale Non-cooperative Games
    Nekouei, Ehsan
    Alpcan, Tansu
    Nair, Girish
    [J]. 2017 11TH ASIAN CONTROL CONFERENCE (ASCC), 2017, : 2083 - 2088
  • [33] Solving Nash Equilibrium for Non-cooperative Game Based on the Particle Swarm Optimization Integrating Multiply Strategies
    Zhao, Yuliang
    Song, Yexin
    Kang, Liwen
    [J]. PROCEEDINGS OF THE 2019 31ST CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2019), 2019, : 4506 - 4511
  • [34] Non-cooperative differential game and feedback Nash equilibrium analysis for real-time electricity markets
    Wu, Chenyu
    Gu, Wei
    Yi, Zhongkai
    Lin, Chenhui
    Long, Huan
    [J]. INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2023, 144
  • [35] Lorenz Equilibrium: Equitability in non-Cooperative Games
    Nagy, Reka
    Suciu, Mihai
    Dumitrescu, D.
    [J]. PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2012, : 489 - 496
  • [36] An Interval Method for Seeking the Nash Equilibria of Non-cooperative Games
    Kubica, Bartlomiej Jacek
    Wozniak, Adam
    [J]. PARALLEL PROCESSING AND APPLIED MATHEMATICS, PART II, 2010, 6068 : 446 - 455
  • [37] On Nash equilibria in non-cooperative all-optical networks
    Bilò, V
    Flammini, M
    Moscardelli, L
    [J]. STACS 2005, PROCEEDINGS, 2005, 3404 : 448 - 459
  • [38] Robust mixed strategies in fuzzy non-cooperative Nash games
    Campos, F. A.
    Villar, J.
    Barquin, J.
    Ruiperez, J.
    [J]. ENGINEERING OPTIMIZATION, 2008, 40 (05) : 459 - 474
  • [39] On Nash Equilibria in Non-Cooperative All-Optical Networks
    Bilo, Vittorio
    Flammini, Michele
    Moscardelli, Luca
    [J]. ALGORITHMS, 2021, 14 (01)
  • [40] Generalized Nash equilibrium models for asymmetric, non-cooperative games on line graphs: Application to water resource systems
    Boyd, Nathan T.
    Gabriel, Steven A.
    Rest, George
    Dumm, Tom
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2023, 154