Hi Everyone! 
I have a question about this particular question in game theory. I am given a matrix A with entries,
[4] [1] [p]
[2-p] [7] [3]
the question is: "find all values of P for which A has a solution in pure strategies"
I have so far considered each point as a straddle point but I havent quite gotten the right answer. For example, for (1,1) to be a straddle point, it would have to be the minimum in its row and maximum in its column, which isn't possible since 4 is not less than 1. I know that P should be a range and not just a couple of values.
thank you in advance!
I have a question about this particular question in game theory. I am given a matrix A with entries,
[4] [1] [p]
[2-p] [7] [3]
the question is: "find all values of P for which A has a solution in pure strategies"
I have so far considered each point as a straddle point but I havent quite gotten the right answer. For example, for (1,1) to be a straddle point, it would have to be the minimum in its row and maximum in its column, which isn't possible since 4 is not less than 1. I know that P should be a range and not just a couple of values.
thank you in advance!