Julialang, Convex Optimization, Algorithms, Multi Objective, Operations Research.
resulting maximum score for the row player will then be 13 and the score is 12 either way for the column player though the column with the greatest sum should be the strategy played by Y. The column player loses by one point. A Nash equilibrium was achieved where each player will not want to change