Ellipsoid projection method in matrix games
Andrzej Cegielski · Optimization · 1992
A problem of calculating a solution of a zero-sum matrix game is considered in the paper The problem of search of a solution is reduced to a constrained convex minimization problem for which an ellipsoid projection algorithm is used. The algorithm generates an ∊-optimal solution of the game in a polynomial time