I'm a computer science student and I have this problem I need to solve for my games theory course. I don't have an example to follow, or use as guidance, and my colleagues are not very helpful( as in, they have no interest in solving this).
I managed to solve a non constant sum problem, as I had an example for that one. But I can't wrap my head around this one.
So, here's the problem:
Consider a finite two person zero-sum game with a payoff matrix A which is a matrix of order 7. Further assume that the row sums and column sums are all equal to 28. Then find the value of the game and a pair of optimal strategies for the two players.}
Some help or guidance would be greatly appreciated! Maybe a solved problem(not necessarily this one), that I can use as an example would be even better, but I don't want to ask too much