The Strategy Elimination (SE) algorithm was proposed in  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.
This work is licensed under a Creative Commons Attribution 4.0 International License.
Please read the Copyright Notice in Journal Policy.