Везде
AN APPROXIMATE METHOD FOR SOLVING FINITE THREE-PERSON GAMES
Table of contents
Annotation Estimate Publication content
References Comments
Share
QR
Metrics
AN APPROXIMATE METHOD FOR SOLVING FINITE THREE-PERSON GAMES
Annotation
PII
S042473880000616-6-1
Publication type
Article
Status
Published
Authors
Evgeny Golshtein 
Edition
Volume 50 Issue 1
Pages
110-116
Abstract

The paper describes a numerical algorithm for solving a finite non-cooperative three-person game in mixed strategies. The algorithm is based on linear programming and is connected with minimization of a function having numerous local minima.

Keywords
non-cooperative game, Nash equilibrium, pure strategy, mixed strategy, game with convex structure, variational inequality
Date of publication
01.01.2014
Number of purchasers
1
Views
842
Readers community rating
0.0 (0 votes)
Cite   Download pdf

References



Additional sources and materials

Gol'shtejn E.G. (2002). Metod resheniya variatsionnykh neravenstv, opredelyaemykh monotonnymi otobrazheniyami // Zhurnal vychislitel'noj matematiki i matematicheskoj fiziki. T. 42. № 7.


Gol'shtejn E.G. (2009a). Ob odnoj zadache ravnovesiya, svyazannoj s beskoalitsionnymi igrami // Ehkonomika i mat. metody. T. 45. № 4.


Gol'shtejn E.G. (2009b). O monotonnosti otobrazheniya, svyazannogo s beskoalitsionnoj igroj mnogikh lits // Zhurnal vychislitel'noj matematiki i matematicheskoj fiziki. T. 49. № 9.


Gol'shtejn E.G. (2012). Ob odnom klasse antagonisticheskikh igr // Ehkonomika i mat. metody. T. 48. № 3.


Gol'shtejn E.G., Malkov U.Kh., Sokolov N.A. (2013). Ob odnom chislennom metode resheniya bimatrichnykh igr // Ehkonomika i mat. metody. T. 49. № 4.


Mills H. (1960). Equilibrium Points in Finite Games // Journal of the Society for Industrial and Applied Mathematics. Vol. 8. No. 2.

Comments

No posts found

Write a review
Translate