An Interval Method for Seeking the Nash Equilibria of Non-cooperative Games

被引：0

作者：

Kubica, Bartlomiej Jacek ^{[1
]}

Wozniak, Adam ^{[1
]}

机构：

[1] Warsaw Univ Technol, Inst Control & Computat Engn, PL-00665 Warsaw, Poland

来源：

PARALLEL PROCESSING AND APPLIED MATHEMATICS, PART II | 2010年 / 6068卷

关键词：

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Computing Nash equilibria in continuous games is a difficult problem In contrast to discrete games, algorithms developed for continues ones are rather inefficient This paper proposes a new approach - making use of interval methods we try to solve the problem directly, seeking points that fulfill Nash conditions We also consider a shared-memory parallelization of the proposed algorithm Preliminary numerical results are presented Some new practical aspects of interval methods are considered

引用

页码：446 / 455

页数：10

共 22 条

[1]

[Anonymous], POSIX THREADS PROGRA

[2]

[Anonymous], 1955, Pac. J. Math, DOI DOI 10.2140/PJM.1955.5.807

[3]

[Anonymous], 1996, Rigorous global search: continuous problems. Nonconvex optimization and its applications

[4]

[Anonymous], 2001, Applied Interval Analysis

[5]

*DDWIKI, NASH EQ

[6]

Gabay D., 1980, Applied stochastic control in econometrics and management science, P271

[7]

Hansen E., 2004, Global Optimization Using Interval Analysis

[8]

JAUERNIG K, 2006, P KAEIOG 06 MURZ 30, P171

[9]

KEARFOTT R., Standardized notation in interval analysis

[10]

Kolodziej J, 2006, PAR ELEC 2006: INTERNATIONAL SYMPOSIUM ON PARALLEL COMPUTING IN ELECTRICAL ENGINEERING, PROCEEDINGS, P313

← 1 2 3 →