Iterated prisoner's dilemma contains evolutionary opponent dominating strategies
pnas.org
pnas.org
Appendix A: """The importance of this result is that the player with the shortest memory in effect sets the rules of the game. A player with a good memory-one strategy can force the game to be played, effectively, as memory-one. She cannot be undone by another player’s longer-memory strategy."""
However, I'm having a hard time understanding how a memory-one strategy actually can be good, given that if your opponent has a theory of mind you apparently want to be paying enough attention to notice and dial down your extortion factor.
Discussion: """However, if she imputes to Y a theory of mind about herself, then she should remain engaged and watch for evidence of Y’s refusing the ultimatum (e.g., lack of evolution favorable to both)."""
How does one actually "remain engaged and watch for evidence" without having access to at least as much memory as their opponent's theory? It would seem that the "should" in this paragraph undermines the "can" in the previous one due to a conflict over "good".
What's happening here, I believe, is that neither of the players are actually playing a memory-one game. They extract a result for memory-one games and try to apply it to reason about a memory-N game, which I believe might be an error.
The "evolutionary" strategy used by Y is in fact a way for Y to base their decision on the outcome of many previous games. X is similarly using a long-term strategy. In the end, the players end up in a meta-game that is similar to the original one.
Note how this meta-game only works if both players agree to it -- if X is "out to lunch", as they put it, or if Y was simply playing a memory-one strategy without evolutionary adaption, the meta-game does not exist.
The title holds - they show how to use a local optimum to exploit a hill-climbing evolutionary player. However this can not be used to beat a true memory-one player, and I think the assumption that Y would require a "theory of mind" to counter this strategy is unfounded.
Quote: "You're about to walk away with my money because you're an idiot."
Even popular books like Richard Dawkins' "The Selfish Gene" talk in some detail about it, and this 25 hour video course is also a must see for pretty much everyone:
(Full Disclosure: {Applied Games in Economics} \in {What I do})
Also, "Game Theory" by Fudenberg and Tirole of you're mathy, or Gibbons if you're wanting a fairly awesome introduction: http://www.amazon.com/Game-Theory-Applied-Economists-ebook/d...
There are also a lot of blogs on algorithmic (computational) game theory if that is of interest to you.
Makes me think of parsers and lookahead-tokens.
http://www.gmilburn.ca/2010/02/24/triumph-of-the-golden-rule...
Good strategy for infrequent players that one is.
Sure, it's a standart problem in game theory, but it's "uninteresting" to say the least
For example, it has a limited Nash Equilibrium http://en.wikipedia.org/wiki/Nash_Equilibrium
It also is rarely applicable to "real situations" like Economy, populations, etc.
Sure, the wikipedia page has various examples, but in real situations it's usually something else, as there are more details
There is:
Stag Hunt http://en.wikipedia.org/wiki/Stag_hunt
http://en.wikipedia.org/wiki/Volunteer%27s_dilemma is also interesting
But really, Prisoner's Dilemma is uniquely fascinating in iterated form [0]. Iterated Stag Hunt would be boring, and Iterated Volunteer's Dilemma would be crazy, but Iterated Prisoner's Dilemma is a very deep game which seems to have things to say about Biology, Politics, and Computer Science all together.
I don't deny the learning importance of the PD. But it would be more interesting if other types of games were explained as well.
Otherwise it's just PD and it gets boring.
About the Iterated PD yes, it's very interesting! Especially evolving competing strategies in it.