Note on unique Nash equilibrium in continuous games

被引：2

作者：

Rehbeck, John ^{[1
]}

机构：

[1] Ohio State Univ, Dept Econ, Columbus, OH 43210 USA

来源：

GAMES AND ECONOMIC BEHAVIOR | 2018年 / 110卷

关键词：

Continuous games; Separable games; Polynomial games; Nash equilibrium; TESTABLE IMPLICATIONS; COLLECTIVE CHOICE;

D O I：

10.1016/j.geb.2018.04.005

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

This note studies whether any set of finitely supported mixed strategies can be represented as the unique Nash equilibrium of a game. This note shows that if strategy spaces are metric spaces containing infinitely many points, then any set of finitely supported mixed strategies can be represented as the unique Nash equilibrium to a separable game. If the strategy spaces are additionally subsets of Euclidean space with infinitely many cluster points, then any set of finitely supported mixed strategies can be represented as the unique Nash equilibrium to a polynomial game. (C) 2018 Elsevier Inc. All rights reserved.

引用

收藏

页码：216 / 225

页数：10

相关论文

共 50 条

[41] On Some Approaches to Find Nash Equilibrium in Concave Games [J].

Chernov, A., V .

AUTOMATION AND REMOTE CONTROL, 2019, 80 (05) :964-988

[42] Infinitely split Nash equilibrium problems in repeated games [J].

Li J. .

Fixed Point Theory and Applications, 2018 (1)

[43] Continuous-time distributed Nash equilibrium seeking algorithms for non-cooperative constrained games [J].

Zou, Yao ;

Huang, Bomin ;

Meng, Ziyang ;

Ren, Wei .

AUTOMATICA, 2021, 127

[44] Existence of Nash equilibrium for chance-constrained games [J].

Singh, Vikas Vikram ;

Jouini, Oualid ;

Lisser, Abdel .

OPERATIONS RESEARCH LETTERS, 2016, 44 (05) :640-644

[45] Network games; Adaptations to Nash-Cournot equilibrium [J].

Flam, SD ;

Horvath, C .

ANNALS OF OPERATIONS RESEARCH, 1996, 64 :179-195

[46] Inefficiency of multiplicative approximate Nash equilibrium for scheduling games [J].

Wang, Zhuyinan ;

Zhang, Chen ;

Tan, Zhiyi .

JOURNAL OF COMBINATORIAL OPTIMIZATION, 2025, 49 (03)

[47] Distributed Algorithm for Continuous-Type Bayesian Nash Equilibrium in Subnetwork Zero-Sum Games [J].

Zhang, Hanzheng ;

Chen, Guanpu ;

Hong, Yiguang .

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2024, 11 (02) :915-927

[48] Algorithms may not learn to play a unique Nash equilibrium [J].

Fujiwara-Greve, Takako ;

Nielsen, Carsten Krabbe .

JOURNAL OF COMPUTATIONAL SOCIAL SCIENCE, 2021, 4 (02) :839-850

[49] Algorithms may not learn to play a unique Nash equilibrium [J].

Takako Fujiwara-Greve ;

Carsten Krabbe Nielsen .

Journal of Computational Social Science, 2021, 4 :839-850

[50] A note on Anti-Nash equilibrium for bimatrix game [J].

Rentsen, Enkhbat .

OPTIMIZATION LETTERS, 2022, 16 (06) :1927-1933

← 1 2 3 4 5 →