After watching The Dark Knight I became rather enthralled with the concept of the Prisoner's Dilemma. There must be an algorithm that that maximizes one's own gain given a situation.
For those that find this foreign: http://en.wikipedia.org/wiki/Prisoner%27s_dilemma
Very, very interesting stuff.
Edit: The question is, what is, if any, the most efficient algorithm that exists for the Prisoner's Dilemma?
Since there is only one choice to make, and in the absence of any changeable inputs, your algorithm is either going to be:
cooperate = true;
...or...
cooperate = false
It's more interesting to find a strategy for the Iterated Prisoner's Dilemma, which is something many people have done. For example http://www.iterated-prisoners-dilemma.info/
Even then it's not 'solvable' since the other player is not predictable.