I don't understand the reference to Core Wars. That is a competitive game, where the objective is to destroy the opposing program. To paraphrase a popular movie, "two programs enter, one program leaves". Also, it should be noted that in the original Prisoner's Dilemma, communication between the prisoners doesn't really help much. Even after agreeing to cooperate, each individual may still want to defect and get the highest possible outcome (going free). We should probably start up a whole new topic on Game Theory. We also need to work in references to rationality? and superrationality?. -- ansible |
One-time PD work for every matrix like this:
- + - a 1 + -1 b Where -1<a<b<1
Iterative PD requires additional assumption that a<0, because if a>0 then switching-cooperation is the best algorithm (you achieve more with not cooperating
than opponent loss from it, so it's best if you both switch, not cooperate)
Are there any other dependencies ?
--Taw
Also, it should be noted that in the original Prisoner's Dilemma, communication between the prisoners doesn't really help much. Even after agreeing to cooperate, each individual may still want to defect and get the highest possible outcome (going free). We should probably start up a whole new topic on Game Theory. We also need to work in references to rationality? and superrationality?. -- ansible