A parallel search of equilibrium points in bimatrix games
Numerical methods and programming, Tome 8 (2007) no. 3, pp. 233-243
Voir la notice de l'article provenant de la source Math-Net.Ru
The paper is focused on a search for the Nash equilibrium in bimatrix games.
In order to solve this problem, we apply the so-called variational approach based on the equivalence theorem of bimatrix games and on a special bilinear programming problem. This bilinear problem is solved using the global search theory. We use the ILOG CIPLEX package to solve auxiliary linear programming problems arising at various stages of the global search algorithm. In addition, a parallel version of this algorithm has been developed.
Both the parallel and sequential algorithms have been extensively tested. Our numerical results confirm the efficiency of the implemented parallel version of the algorithm.
Mots-clés :
bimatrix games
Keywords: Nash equilibrium, local search, global search, parallel computing, mathematical programming.
Keywords: Nash equilibrium, local search, global search, parallel computing, mathematical programming.
@article{VMP_2007_8_3_a2,
author = {I. L. Vasiliev and K. B. Klimentova and A. V. Orlov},
title = {A parallel search of equilibrium points in bimatrix games},
journal = {Numerical methods and programming},
pages = {233--243},
publisher = {mathdoc},
volume = {8},
number = {3},
year = {2007},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMP_2007_8_3_a2/}
}
TY - JOUR AU - I. L. Vasiliev AU - K. B. Klimentova AU - A. V. Orlov TI - A parallel search of equilibrium points in bimatrix games JO - Numerical methods and programming PY - 2007 SP - 233 EP - 243 VL - 8 IS - 3 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VMP_2007_8_3_a2/ LA - ru ID - VMP_2007_8_3_a2 ER -
I. L. Vasiliev; K. B. Klimentova; A. V. Orlov. A parallel search of equilibrium points in bimatrix games. Numerical methods and programming, Tome 8 (2007) no. 3, pp. 233-243. http://geodesic.mathdoc.fr/item/VMP_2007_8_3_a2/