Numerical search for equilibria in bimatrix games
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 45 (2005) no. 6, pp. 983-997
Voir la notice de l'article provenant de la source Math-Net.Ru
Numerical search for Nash equilibria in a bimatrix game is analyzed by applying the variational approach. To solve an associated nonconvex mathematical programming problem, a modified global search algorithm is proposed that is based on global optimality conditions for this problem. The efficiency of the algorithm is demonstrated by numerical results.
@article{ZVMMF_2005_45_6_a3,
author = {A. V. Orlov and A. S. Strekalovskii},
title = {Numerical search for equilibria in bimatrix games},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {983--997},
publisher = {mathdoc},
volume = {45},
number = {6},
year = {2005},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_2005_45_6_a3/}
}
TY - JOUR AU - A. V. Orlov AU - A. S. Strekalovskii TI - Numerical search for equilibria in bimatrix games JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 2005 SP - 983 EP - 997 VL - 45 IS - 6 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/ZVMMF_2005_45_6_a3/ LA - ru ID - ZVMMF_2005_45_6_a3 ER -
A. V. Orlov; A. S. Strekalovskii. Numerical search for equilibria in bimatrix games. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 45 (2005) no. 6, pp. 983-997. http://geodesic.mathdoc.fr/item/ZVMMF_2005_45_6_a3/