ON THE GENERIC NONEXISTENCE OF PURE STRATEGY NASH EQUILIBRIA IN CONTINUOUS GAMES

被引:0
|
作者
LEBRETON, M
机构
关键词
D O I
10.1016/0022-0531(87)90068-8
中图分类号
F [经济];
学科分类号
02 ;
摘要
引用
收藏
页码:374 / 382
页数:9
相关论文
共 50 条
  • [21] The number of pure strategy Nash equilibria in random multi-team games
    Stanford, William
    ECONOMICS LETTERS, 2010, 108 (03) : 352 - 354
  • [22] On existence of undominated pure strategy Nash equilibria in anonymous nonatomic games: a generalization
    Codognato, G
    Ghosal, S
    INTERNATIONAL JOURNAL OF GAME THEORY, 2003, 31 (04) : 493 - 498
  • [23] Pure Nash Equilibria in Restricted Budget Games
    Drees, Maximilian
    Feldotto, Matthias
    Riechers, Soeren
    Skopalik, Alexander
    COMPUTING AND COMBINATORICS, COCOON 2017, 2017, 10392 : 175 - 187
  • [24] Constrained pure Nash equilibria in graphical games
    Greco, G
    Scarcello, F
    ECAI 2004: 16TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 110 : 181 - 185
  • [25] Pure Nash Equilibria in Resource Graph Games
    Harks, Tobias
    Klimm, Max
    Matuschke, Jannik
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2021, 72 : 185 - 213
  • [26] Pure nash equilibria in resource graph games
    Harks T.
    Klimm M.
    Matuschke J.
    Journal of Artificial Intelligence Research, 2021, 72 : 185 - 213
  • [27] Pure nash equilibria: Hard and easy games
    Gottlob, G. (GOTTLOB@DBAI.TUWIEN.AC.AT), 1600, American Association for Artificial Intelligence (24):
  • [28] Pure Nash equilibria of coordination matrix games
    Roberts, DP
    ECONOMICS LETTERS, 2005, 89 (01) : 7 - 11
  • [29] Constrained Pure Nash Equilibria in Polymatrix Games
    Simon, Sunil
    Wojtczak, Dominik
    THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 691 - 697
  • [30] Pure Nash equilibria: Hard and easy games
    Gottlob, G
    Greco, G
    Scarcello, F
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2005, 24 : 357 - 406