Evolutionary Algorithms for Finding Nash Equilibria in Electricity Markets

被引:39
|
作者
Zaman, Forhad [1 ]
Elsayed, Saber M. [1 ]
Ray, Tapabrata [1 ]
Sarker, Ruhul A. [1 ]
机构
[1] Univ New South Wales, Sch Engn & Informat Technol, Canberra, ACT 2610, Australia
基金
澳大利亚研究理事会;
关键词
Differential evolution; energy market; game theory; genetic algorithm; SUPPLY FUNCTION EQUILIBRIUM; ECONOMIC-DISPATCH PROBLEMS; BIDDING STRATEGY; GENETIC ALGORITHM; GENERATION; MODELS; OPTIMIZATION; COMPUTATION; SEARCH; POWER;
D O I
10.1109/TEVC.2017.2742502
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Determining the Nash equilibria (NEs) in a competitive electricity market is a challenging economic game problem. Although finding one equilibrium has been well studied, detecting multiple ones is more practical and difficult, with a few attempts to solve such discrete game problems. However, most of the real-life game problems, such an energy market is a continuous one containing infinite sets of strategy that can be adopted by each player. Therefore, in this paper, a co-evolutionary approach is proposed for detecting multiple NEs in a single run involving continuous games among N-players. Five standard test functions and three IEEE energy market problems in three different scenarios are solved, and their results are compared with those obtained from state-of-the-art algorithms. The results clearly show the benefits of the proposed approach in terms of both the quality of solutions and efficiency.
引用
收藏
页码:536 / 549
页数:14
相关论文
共 50 条
  • [41] Computing Nash equilibria by means of evolutionary computation
    Lung, Rodica Ioana
    Dumitrescu, Dan
    INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, 2008, 3 : 364 - 368
  • [42] Direct Evolutionary Search for Nash Equilibria Detection
    Lung, R. I.
    INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, 2016, 11 (04) : 472 - 479
  • [43] Evolutionary Approaches to Joint Nash - Pareto Equilibria
    Dumitrescu, D.
    Lung, Rodica Ioana
    Mihoc, Tudor Dan
    NICSO 2010: NATURE INSPIRED COOPERATIVE STRATEGIES FOR OPTIMIZATION, 2010, 284 : 233 - 243
  • [44] Absolutely expedient algorithms for learning Nash equilibria
    Phansalkar, V.V.
    Sastry, P.S.
    Thathachar, M.A.L.
    Proceedings of the Indian Academy of Sciences: Mathematical Sciences, 1994, 104 (01):
  • [45] NASH EQUILIBRIA: GRADIENT AND DECOMPOSITION ALGORITHMS.
    Cohen, Guy
    Large Scale Systems, 1987, 12 (02): : 173 - 184
  • [46] ABSOLUTELY EXPEDIENT ALGORITHMS FOR LEARNING NASH EQUILIBRIA
    PHANSALKAR, VV
    SASTRY, PS
    THATHACHAR, MAL
    PROCEEDINGS OF THE INDIAN ACADEMY OF SCIENCES-MATHEMATICAL SCIENCES, 1994, 104 (01): : 279 - 294
  • [47] Finding Mixed Nash Equilibria of Generative Adversarial Networks
    Hsieh, Ya-Ping
    Liu, Chen
    Cevher, Volkan
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 97, 2019, 97
  • [48] An algorithm for finding approximate Nash equilibria in bimatrix games
    Gao, Lunshan
    SOFT COMPUTING, 2021, 25 (02) : 1181 - 1191
  • [49] An algorithm for finding approximate Nash equilibria in bimatrix games
    Lunshan Gao
    Soft Computing, 2021, 25 : 1181 - 1191
  • [50] Finding mixed strategy Nash equilibria with decision trees
    Cobb, Barry R.
    Sen, Tinni
    INTERNATIONAL REVIEW OF ECONOMICS EDUCATION, 2014, 15 : 43 - 50