I am looking for the formula for the solution of a two-player,
zero-sum game where each player has exactly two possible strategies
and a demonstration of the formula's derivation.

---

Clarification of Question by caray-ga on 14 Nov 2004 16:22 PST

ADDENDUM: The formula should allow for the (possible) use of mixed
strategies by either player.

This linked page may be of interest to you;

http://www.economics.laurentian.ca/Strategic_Think.27/Modules/Course_Schedule.98/Mixed%20stratetgies/Optimal%20Mixed%20strategy.htm

Do a search for "Prisoners' Dilemma"

:)

alex

The link above is very good, although the diagrams don't come through
well on my monitor.  If anyone has a link where the solution is
derived by linear algebra, rather than graphically, that would be
fantastic.  (Although, I had been using graphs in an attempt to derive
the solution on my own; this is why I'd like to see a
demonstration--to convince my method that I found the correct method,
rather than overlooking some fallacy in my reasoning)

I will look for links on PD, although it is not zero-sum, perhaps it
will link to pages that cover the zero sum case.

Thanks!

"--to convince my method that I found the correct method,
rather than overlooking some fallacy in my reasoning"

which in English means: --to convice me that the method I found is the
correct one, rather than my overlooking some fallacy in my reasoning.