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

Jonas Mockus; Martynas Sabaliauskas

doi:10.15388/LMR.A.2013.18

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.

Download Citation

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

Downloads

Download data is not yet available.

Most read articles by the same author(s)

Martynas Sabaliauskas, Jonas Mockus, On the Nash equilibrium in the inspector problem , Lietuvos matematikos rinkinys: Vol. 55 (2014): Ser. A
Jonas Mockus, Irina Vinogradova, Bayesian approach to evaluation of distance courses , Lietuvos matematikos rinkinys: Vol. 55 (2014): Ser. B
Jonas Mockus, Joana Katina, Igor Katin, On autoregressive moving-average models as a tool of virtual stock-exchange: experimental investigation , Lietuvos matematikos rinkinys: Vol. 53 (2012): Ser. A
Jonas Mockus, Justas Stašionis, On the experimental investigation of Pareto–Lipschitzian optimization , Lietuvos matematikos rinkinys: Vol. 52 (2011)
Jonas Mockus, Igor Katin, Joana Katina, On experimental investigation of the web-based stock-exchange model , Lietuvos matematikos rinkinys: Vol. 53 (2012): Ser. A
Igoris Belovas, Martynas Sabaliauskas, Paulius Mykolaitis, On the calculation of integer sequences, associated with twin primes , Lietuvos matematikos rinkinys: Vol. 64 (2023): Ser. B