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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have