Везде
DUAL METHOD FOR SOLUTION OF BIMATRIX GAMES
Table of contents
Annotation Estimate Publication content
References Comments
Share
QR
Metrics
DUAL METHOD FOR SOLUTION OF BIMATRIX GAMES
Annotation
PII
S042473880000616-6-1
Publication type
Article
Status
Published
Authors
Anna Lipatova  Aleksey Zaslavsky
Edition
Volume 48 Issue 4
Pages
113-118
Abstract

The paper focuses on the research of the dual method for finding equilibrium points in bimatrix game. The convergence of this method isn’t proved, but the computational experiments demonstrate that it can be used for solving the bimatrix games.

Keywords
bimatrix games, linear programming, dual problem
Date of publication
01.10.2012
Number of purchasers
1
Views
761
Readers community rating
0.0 (0 votes)
Cite   Download pdf
1

References



Additional sources and materials

Strekalovskij A.S., Orlov A.V. (2007). Bimatrichnye igry i bilinejnoe programmirovanie. M.: Fizmatlit.


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


Nash J.F. (1950). Equilibrium Points in n-Person Games. Proceedings of the National Academy of Sciences. Vol. 36.


McKelvey R.D., McLennan A. (1996). Computation of Equilibria in Finite Games. Handbook of Computational Economics. Vol. 1 / H.M. Amman, D.A. Kendrick, J. Rust (eds.). Vol. 1. Amsterdam, Holland: Elsevier.

Comments

No posts found

Write a review
Translate