Zero Sum Games
Thread and Full Text View
I didn't say you can't use linear algebra to find a pure strategy NE. I said that it is easier to check for them first (at least for me it is easier to do it when the game is simple), and also it gives me reference of how many NE in [View full text and thread]
|09/12/2000 09:27 AM by Walter;|
Thanks Walter. What doesn't make sense to me is why I cannot use linear algebra to determine that there is a pure strategy. In other words, why I don't get t=1, and 1-t=0. There are other pure strategy games where I don't get t=7/5 or similar...where I get t=3/5, etc. So I guess I need to determine if there is a pure strategy first?
I was trying to write a simple calculator to solve these games. But now I'll have to figure out an algorithm for first determining if there is a pure strategy. Any ideas?
Let me repeat the game
ROW U 3 5
D 1 -2
The numbers are player ROW's payoffs, since COL's payoffs are the negative of those (or some other number such that the sum of the utilities is [View full text and thread]
|09/04/2000 09:11 AM by Walter;|
I am trying to solve the zero-sum game:
Ignoring for the moment that this game has a saddle point, how can I solve using linear algebra?
If I assign the column player fractional times Q and (1-Q), I should get Q=1, as [View full text and thread]
|09/02/2000 01:59 PM by KR Simpson; Solution with a saddle point...|