This article develops a new algorithm for computing Nash equilibria of N -player games. The algorithm approximates a game by a sequence of polymatrix games in which the players interact bilaterally. We provide su cient conditions for local convergence to an equilibrium and report computational exper
β¦ LIBER β¦
Computing generalized Nash equilibria by polynomial programming
β Scribed by Couzoudis, Eleftherios; Renner, Philipp
- Book ID
- 118277395
- Publisher
- Springer
- Year
- 2013
- Tongue
- English
- Weight
- 201 KB
- Volume
- 77
- Category
- Article
- ISSN
- 0340-9422
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Computing Nash equilibria by iterated po
β
Srihari Govindan; Robert Wilson
π
Article
π
2004
π
Elsevier Science
π
English
β 249 KB
Computing All Nash Equilibria of Multipl
β
Yan Yang; Yao Zhang; Fangxing Li; Haoyong Chen
π
Article
π
2012
π
IEEE
π
English
β 514 KB
Optimization of models derived by dimens
β
Gary E. Blau
π
Article
π
1971
π
Elsevier Science
π
English
β 486 KB
The design relations of many engineering systems are obtained by dimensional analysis or fitting power functions to experimental data. This paper describes a nonlinear optimization technique called "generalized polynomial programming", an extension of geometric programming, which optimizes the desig
Polynomial and spline approximation by q
β
Amos, D. E.; Slater, M. L.
π
Article
π
1969
π
Association for Computing Machinery
π
English
β 254 KB
GCINFE: A computer program for inference
β
Eulogio Pardo-IgΓΊzquiza
π
Article
π
1997
π
Elsevier Science
π
English
β 831 KB
MRF: A FORTRAN IV computer program for t
β
A.S Andrew; J Linde
π
Article
π
1980
π
Elsevier Science
π
English
β 483 KB