On the exact polynomial time algorithm for a special class of bimatrix game
Articles
Jonas Mockus
Vilnius University
Martynas Sabaliauskas
Vilnius University
Published 2013-12-15
https://doi.org/10.15388/LMR.A.2013.18
PDF

Keywords

game theory
polynomial algorithm
Nash equilibrium

How to Cite

Mockus J. and Sabaliauskas M. (2013) “On the exact polynomial time algorithm for a special class of bimatrix game”, Lietuvos matematikos rinkinys, 54(A), pp. 85–90. doi: 10.15388/LMR.A.2013.18.
ACM ACS APA ABNT Chicago Harvard IEEE MLA Turabian Vancouver

Download Citation

Endnote/Zotero/Mendeley (RIS) BibTeX
Vol 54 (2013)

On the exact polynomial time algorithm for a special class of bimatrix game

Abstract

The Strategy Elimination (SE) algorithm was proposed in [2] and implemented by a sequence of Linear Programming (LP) problems. In this paper an efficient explicit solution is developed and the convergence to the Nash Equilibrium is proven.
Keywords: game theory, polynomial algorithm, Nash equilibrium.

PDF
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Please read the Copyright Notice in Journal Policy. 

Downloads

Article Views | PDF Downloads
Range Graph | Chart Graph