On the Convergence of the Lemke–Howson Algorithm for Bi-Matrix Games
- Авторлар: Nabatova D.S.1
-
Мекемелер:
- Financial University under the Government of the Russian Federation
- Шығарылым: Том 216, № 5 (2016)
- Беттер: 702-715
- Бөлім: Article
- URL: https://bakhtiniada.ru/1072-3374/article/view/237900
- DOI: https://doi.org/10.1007/s10958-016-2932-9
- ID: 237900
Дәйексөз келтіру
Аннотация
We discuss conditions that guarantee the convergence of the computational Lemke–Howson algorithm for the solution of bi-matrix games and the computation of all Nash equilibria. An example is also presented.
Авторлар туралы
D. Nabatova
Financial University under the Government of the Russian Federation
Хат алмасуға жауапты Автор.
Email: nabatova805@mail.ru
Ресей, Moscow
Қосымша файлдар
