AN ALGORITHM OF FINDING MORE THAN ONE EQUILIBRIUM POINT OF A BIMATRIX GAME

被引:0
|
作者
SOOS, Z
机构
来源
关键词
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:T422 / T423
页数:2
相关论文
共 50 条
  • [1] Exponentially many steps for finding a nash equilibrium in a bimatrix game
    Savani, R
    von Stengel, B
    45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2004, : 258 - 267
  • [2] D. C. OPTIMIZATION APPROACH FOR FINDING BERGE EQUILIBRIUM IN BIMATRIX GAME
    Sagaarenchen, Mengkezhula
    Sukhee, Batbileg
    Rentsen, Enkhbat
    Gompil, Battur
    NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION, 2024,
  • [3] One Method for Computing the Pareto-Optimal Nash Equilibrium in Bimatrix Game
    Kudryavtsev, Konstantin
    Zhukovskiy, Vladislav
    Stabulit, Irina
    2017 CONSTRUCTIVE NONSMOOTH ANALYSIS AND RELATED TOPICS (DEDICATED TO THE MEMORY OF V.F. DEMYANOV) (CNSA), 2017, : 175 - 177
  • [4] Optimization approach to Berge equilibrium for bimatrix game
    Rentsen Enkhbat
    Batbileg Sukhee
    Optimization Letters, 2021, 15 : 711 - 718
  • [5] Optimization approach to Berge equilibrium for bimatrix game
    Enkhbat, Rentsen
    Sukhee, Batbileg
    OPTIMIZATION LETTERS, 2021, 15 (02) : 711 - 718
  • [7] MORE THAN ONE WAY OF FINDING A FISH
    BARTON, R
    WORLD FISHING, 1972, 21 (04): : 10 - &
  • [8] Finding More Than One Worm in the Apple
    Bland, Mike
    COMMUNICATIONS OF THE ACM, 2014, 57 (07) : 58 - 64
  • [9] Finding more than one worm in the apple
    Bland, Mike
    Bland, M., 1600, Association for Computing Machinery, 2 Penn Plaza, Suite 701, New York, NY 10121-0701, United States (12): : 10 - 21
  • [10] A Note on Anti-Berge Equilibrium for Bimatrix Game
    Enkhbat, R.
    BULLETIN OF IRKUTSK STATE UNIVERSITY-SERIES MATHEMATICS, 2021, 36 : 3 - 13