| Title |
On the exact polynomial time algorithm for a special class of bimatrix game / |
| Another Title |
Efektyvus algoritmas specialiam bimatricinio lošimo uždaviniui spręsti. |
| Authors |
Mockus, Jonas ; Sabaliauskas, Martynas |
| DOI |
10.15388/LMR.A.2013.18 |
| Full Text |
|
| Is Part of |
Lietuvos matematikos rinkinys. Ser. A.. Vilnius : Vilniaus universiteto leidykla. 2013, t. 54, p. 85-90.. ISSN 0132-2818. eISSN 2335-898X |
| Keywords [eng] |
game theory ; polynomial algorithm ; Nash equilibrium |
| Abstract [eng] |
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. |
| Published |
Vilnius : Vilniaus universiteto leidykla |
| Type |
Journal article |
| Language |
English |
| Publication date |
2013 |
| CC license |
|
