Prerequisites: Basic knowledge of the Prisoner's Dilemma and the Iterated Prisoner's Dilemma.

I recently stumbled upon the selective IPD tournament results, and while I was very interested in the general concept I was also very disappointed by the strategies that were submitted, especially considering this is Less Wrong we are talking about.

This post is designed to help people who are interested in IPD problems to come up with possibly successful strategies; hopefully the same effect another couple of tournaments would have, just in a shorter period of time. All of the following is written with the tournament rules in mind, with scores depicted as deviations of matches with full mutual cooperation since the actual number of turns per match is arbitrary anyway. Also, the hypothetical objective is not to have the highest population after a certain number of generations, but to achieve lasting superiority eventually while treating near-clones that behave exactly the same in the late game as one single strategy. The results of tournaments with a very limited number of generations depend way too much on the pool of submitted strategies to be of general interest, in my opinion.

This post starts out with practical observations and some universal rules and gets increasingly theoretical. Here is a short glossary of terms I presume known:

Feeding on a strategy: Scoring higher against that strategy in a match than against itself.
Outperforming a strategy: Outscoring that strategy over the course of matches against all other strategies in the pool according to populations, including each other and themselves (i.e. improving the population ratio).
Dominance: More than 50% of the total population.
Dormant strategy: A strategy that will achieve dominance at some point but hasn't done so yet.
Extinction: Asymptotical approach to 0% percent of the total population, or actual extinction in case of integer truncation.
TFT-nD: A TFT strategy that defects from the nth last turn on, so TFT-0D is vanilla TFT.

Disclaimer: There is only very basic mathematics and logical reasoning in this post, so if anything seems confusing, it must be me using the wrong words (I'm not a native speaker). Please point out any of these cases so that I can correct them.


Survival And Dominance

Let us assume a scenario with only two strategies, one of them dominating which we call X, the other one A.

Survival Rule:
For A in this scenario not to go extinct regardless of initial population, it must score at least equally high against X as X does against itself, and if it doesn't score higher, it must score at least equally high against itself as X does against itself while not losing direct encounters.

Let us assume X is TFT-0D and A is TFT-1D, in which case the numbers are as follows:

TFT-0D vs TFT-0D =   0 :  0
TFT-1D vs TFT-0D = +3 : -4

The survival ratio is +3 : 0. Therefore, in any situation with only TFT and TFT-1D, the latter cannot go extinct. This still doesn't tell us anything about what's needed for achieving dominance, so let's get on with that.

Dominance rule:
For any strategy to achieve dominance in a two-strategy situation where its survival is guaranteed according to the survival rule or where both strategies initially make up for half of the total population, it needs to outscore the other strategy over the course of these four matches:
X vs X
A vs X (2x)
A vs A

Let us again do the numbers with TFT-0D and TFT-1D:

TFT-0D vs TFT-0D =   0 : 0
TFT-1D vs TFT-0D = +3 : -4
TFT-1D vs TFT-0D = +3 : -4
TFT-1D vs TFT-1D =  -3 : -3

On aggregate, the dominance ratio is 0 : -8. Therefore, TFT-1D will achieve dominance.

The conditions for A to exterminate the formerly dominant strategy X follow directly from the conditions for avoiding extinction, and since being the only surviving strategy is not the objective anyway they aren't interesting at this point.

Threshold rule:
If A fulfills the conditions for dominance but not the conditions for survival (i.e. it scores less against X than X does against itself), it will need a certain threshold to avoid extinction and achieve dominance.

Thresholds vary from strategy to strategy, but are obviously always below 50%. The more balanced the survival ratio is, the higher the threshold. In most cases though, the threshold is much too low to be of any relevance in a selective tournament.

You can easily see that any TFT-nD will be dominated by n+1. However, with increasing n the strategy will score lower not only against itself, but also against any TFT-mD with m <= n-2, which makes TFT-nD with large n very unsuccessful in the early generations of the tournament.


A Word About Afterparty

The logical solution to this problem are "Afterparty" strategies that are essentially TFT-nD CliqueBots that return to cooperating if their opponent defected first on the same turn as them. I refer to these strategies as Efficient CliqueBots for reasons that will become apparent later on.

The "Afterparty" strategy suggested on Less Wrong first defects on the sixth last turn, I will therefore call it TFT-D5C from here on. In a TFT-nD dominated tournament, however, TFT-D5C is not the optimum, as you can check by doing the math above. The optimum is in fact TFT-D3C, because it is the TFT-DnC with the lowest n that can exterminate any TFT-DmC with m > n (if the other strategy falls below a certain threshold) as well as dominate any TFT-mD with m >= n - 2 (if it reaches a certain threshold). This means that in a tournament similar to the control group tournament over 1000 generations, it would eventually achieve domination since it is safe from extinction due to scoring equally high respectively higher against TFT-2D and TFT-3D than those score against themselves while winning direct encounters and scoring higher against itself anyway (survival rule):

TFT-DnC vs TFT-DnC = -3 : -3

TFT-2D vs TFT-2D = -6 : -6
TFT-D3C vs TFT-2D = -6 : -13

TFT-3Dvs TFT-3D = -9 : -9
TFT-D3C vs TFT-3D = -6 : -13

Also, it outscores TFT-4D (-32 : -38) and TFT-5D (-38 : -48):

TFT-4D vs TFT-4D = -12 : -12
TFT-D3C vs TFT-4D = -13 : -6
TFT-D3C vs TFT-4D = -13 : -6
TFT-D3C vs TFT-D3C = -3 : -3

TFT-5D vs TFT-5D = -15 : -15
TFT-D3C vs TFT-5D = -16 : -9
TFT-D3C vs TFT-5D = -16 : -9
TFT-D3C vs TFT-D3C = -3 : -3

This means that in a situation where TFT-D3C is initially equally well represented as TFT-4D or TFT-5D, it will eventually outperform those (not taking into account TFT-5D feeding on TFT-4D if both are present).

In any situation with only two strategies both being TFT-DnC variants, TFT-D3C will exterminate any other TFT-DnC strategies once that strategy falls below a certain threshold, because no other TFT-DnC strategy can score higher against TFT-D3C or itself than TFT-D3C does against itself. This is trivially true for all TFT-DnC strategies starting from n = 2:

TFT-D2C vs TFT-D2C = -3 : -3
TFT-D3C vs TFT-D2C = -6 : -13

The threshold decreases for increasing n.

TFT-D3C is also certain to gain a better start than any other TFT-DnC strategies with n > 3 due to higher gain from TFT-nD strategies with n <= 3 that dominate the early game. TFT-D1C is essentially the same as TFT-1D and equally outperformed by TFT-2D, while TFT-D2C cannot prevent TFT-D3C from crossing its threshold as TFT-D3C can feed on TFT-2D as well as on TFT-3D / TFT-D2C. This pretty much leaves TFT-D3C as the only viable TFT-DnC strategy to survive in a selective tournament of this kind. However this doesn't take into account true parasites which I will talk more about later.



CliqueBots have faired very poorly in this tournament, however that is mostly because they have been very poorly designed. A CliqueBot that needs five defections to identify a clone is doomed from the start, and any strategy that turns into DefectBot after identifying an alien strategy before the last turns is very doomed anyway. It seems that even though participants anticipated TFT-1D and even TFT-2D, no one considered cooperative CliqueBots a possible solution, which is surprising. So let me introduce a CliqueBot that could technically be considered another optimum of TFT-DnC, although it behaves slightly different (it is not an Efficient CliqueBot). The main idea is to defect on the very first turn and cooperate if the opponent's previous move matches its own previous move, i.e. if facing a clone, and playing TFT-2D or TFT-3D otherwise. Also in case the game begins with defect-coop followed by coop-defect, the CliqueBot will cooperate for a second time, since the opponent can be considered a TFT variant and a high number of mutual cooperations is benefitial. To keep the name short and follow the established naming system, I will from here on refer to CliqueBot strategies that defect once on turn i and otherwise behave pretty much as TFT-nD strategies as i/TFT-nD.

Some comparison with selected strategies as described in the rules for dominance (four matches each):

1/TFT-3D vs TFT-0D = -14 : -22
1/TFT-3D vs TFT-1D = -14 : -28
1/TFT-3D vs TFT-2D = -14 : -34
1/TFT-3D vs TFT-3D = -26 : -38
1/TFT-3D vs TFT-4D = -34 : -38
1/TFT-3D vs TFT-5D = -40 : -50

However, the survival of any 1/TFT-nD is guaranteed only against TFT-mD with m = n-1. In addition, any TFT-DmC with m >= n-1 will outperform 1/TFT-nD, so 1/TFT-nD (or any other i/TFT-nD for that matter) cannot prevail.


Parasites, Identification And Efficient CliqueBots

A true parasite is any strategy that pretends to be a clone of its host until the last possible opportunity of gainful defection. TFT is essentially a CliqueBot that identifies its clones by sustained cooperation, and TFT-1D is a parasite of TFT as TFT-2D is of TFT-1D and so on.

Parasite rule:
Since parasites trade points gained from encounters with clones for points gained from encounters with hosts, parasites can never go extinct in a scenario with only them and their hosts, no matter how little their population. Any parasite will also ultimatively achieve dominance in these scenarios, because the points gained from one-sided defection (+7) are more than the points lost from mutual defection (-3).

Of which follows the dormancy rule:
A strategy can only win an open-ended selective IPD tournament if it stays dormant until its own parasite has gone extinct.

This means that theoretically any parasite only needs to survive long enough until it is the only strategy left besides its host to achieve ultimate victory, as was the case with TFT-3D, parasite of TFT-2D in the thousand generations tournament. This can easily be achieved if the host is the dominant strategy, because the parasite is better equipped to feed on the host than any other strategy in the pool, which is a guarantee of survival. However, the situation becomes very difficult for a parasite of a parasite of a dominant host in the early game, which is why TFT-4D is probably the highest TFT-nD able to survive and therefore to achieve dominance in this kind of tournament with integer rounding.

This brings us back to Efficient CliqueBots. All CliqueBots, including vanilla TFT, use identification patterns to identify clones in order to maximise total point gain. Parasites make use of these patterns in order to pretend to be their hosts and maximise their own point gain. Nice CliqueBots like vanilla TFT identify their clones by continuous cooperation, which makes them unable to identify other nice CliqueBots as non-clones. This is why TFT can't ever defect on the last turn when facing CooperateBot and why nice CliqueBots aren't usually considered "real" CliqueBots. Non-nice CliqueBots detect clones by mutual defections at fixed identification turns, and cooperate from there on if facing a clone in order to maximise total point gain and avoid the danger of losing points in the late game. So what's better than a parasite of a dominant host? Well obviously a parasite of a dominant host that's also a CliqueBot - because that's what TFT-DnC strategies are, Efficient CliqueBots.

The decisive feature of Efficient CliqueBots is that their identification turn is late enough so that in case of an alien opponent, they can simply continue defecting until the end, maximizing their efficiency and allowing them to perform better against TFT-nD strategies with higher n. Now the funny thing is that for example TFT-3D is a parasite of not only TFT-2D, but also TFT-D2C, which is what makes TFT-D3C the optimal TFT-DnC because it still outperforms TFT-4D. But is TFT-4D really the optimal parasite of TFT-D3C? Obviously not, because that would be TFT-D2CD - an Efficient CliqueBot parasite of an Efficient CliqueBot parasite (TFT-D3C) of a parasite (TFT-3D) of a parasite (TFT-2D) of a parasite (TFT-1D) of a nice CliqueBot (TFT-0D). According to the parasite rule, in a scenario with only TFT-D3C and TFT-D2CD, the latter will ultimately achieve dominance. Of course it has its own parasite in TFT-DC2D, which in turn has its own parasite TFT-2D2C, which is the host of TFT-2DCD, host of TFT-4D. And TFT-D4C and so on until DefectBot. Obviously DefectBot isn't the solution, it's only a solution to one specific strategy. So what is the solution? Well that mostly depends on the pool of submitted strategies, but the Efficient CliqueBot TFT-D3C still seems a pretty good guess.


Composite Strategies: Parasite-Host Tandems

So how can we make sure our parasite strategy stays dormant long enough? Well there's one less-than obvious choice, which is to turn it into a Composite strategy. A Composite is pretty much what the name says: At the beginning of each match, with some probability execute strategy A, else execute strategy B. For example, a parasite could with 99% probability execute its host's strategy (e.g. TFT-0D), and with 1% execute the actual parasite strategy (TFT-1D). This would in most cases result in the death of the parasite's parasite (TFT-2D) while still resulting in absolute dominance, albeit very slowly. However this would obviously allow a singleton TFT-1D to feed on the Composite as well as on singleton TFT-0D, achieving dominance very quickly, while at the same time feeding TFT-2D. So 1% doesn't seem to be the ideal percentage, and TFT-2D would have been able to feed on TFT-0D anyway, so TFT-1D is a lost cause from the beginning. Also, even if there never was a singleton TFT-1D and TFT-2D, a similar tandem strategy could simply increase the percentage a bit.

So let's stop talking about Parasite-Host Tandems and instead focus on other kinds of Composites that seem more promising.


Composite Strategies: Independent Tandems

These are Composites of two strategies that don't aim to achieve dormancy by keeping their hosts dominant until any own parasites have gone extinct. Instead the idea is that if two independent strategies achieve common dominance, it is less likely that both of their parasites survive. You could obviously increase the number of strategies, but this will create some problems I'll talk more about later. First of all, let us assume a 50-50 tandem of TFT-2D and UtopiaBot, the latter being an imaginary strategy that has no parasites and scores high against itself. Both strategies are highly efficient and will soon eliminate TFT-0D and TFT-1D, but TFT-3D will survive. However, TFT-3D will be unable to achive dominance, since the situation is basically that it can only feed on TFT-2D which makes up only half of the tandem's population, while it still has to deal with UtopiaBot which it is not designed for.

Of course there is a big issue with Independent Tandems: You need to find two somewhat successful strategies with different parasites who score reasonably high against themselves as well as against each other. An obvious candidate for this would be a tandem of an Efficient CliqueBot like TFT-D3C and a regular CliqueBot that continues to cooperate after a single opponent retaliation and defects on the last turns, like 1/TFT-3D. This CliqueBot would cooperate until the end if the initial defection was not met by retaliation (facing the sibling) and TFT-D3C would cooperate until the end if the opponent defected only on the identification turn which it would not retaliate against.


Composite Strategies: Parasite Killer Tandems

Another option would be a tandem of two strategies of which one is the parasite of the other's parasite, e.g. TFT-2D and TFT-D3C, the latter taking care of both TFT-3D and TFT-D2C. Here, the Efficient CliqueBot TFT-D3C would revert to cooperation if the defections on the 3rd and 4th last turns have not been met by retaliation, effectively turning it into TFT-2D2C, and TFT-2D would not retaliate after defections on these turns. The main problem with Parasite Killer Tandems like these is that a singleton TFT-2D will also profit from TFT- 2D2C killing TFT-3D strategies. This is somewhat offset by TFT- 2D2C also slowly killing singleton TFT-2D, but possibly not enough to prohibit TFT-3D from feeding on it. This depends on the strategies in the tandem and the amount of surviving parasites. In addition, the parasite killer's parasite (in this case TFT-D2CD) may prove a problem as well as parasites of both strategies (TFT-4D), although these should be pretty low in numbers at that point, probably unable to achieve dominance.


Composite Strategies: Random CliqueBots

A Composite can consist of an arbitrary high number of strategies, combining Parasite Killers with independent strategies. The only limitations are the effectiveness of the individual strategies and the ability of these strategies to score high against each other, although the latter is not so much a problem as coop-defect loses only 1 point.

In fact coop-defect is so much superior to defect-defect that this brings us to another kind of Composite strategies: Random CliqueBots, which are basically i/TFT-nD CliqueBots with randomized i. For example, if i ranges from 1 to 10, this strategy wouldn't retaliate against an opponent's first defection on either of turns 1 to 10, thus reducing point loss from identifying clones/siblings. With increasing ranges of i, point loss approaches 1 which is much lower than the 6 points lost by regular CliqueBots with fixed i.

Random CliqueBot vs Efficient CliqueBot dominance ratio:

TFT-D3C vs TFT-D3C = -3 : -3
1-∞/TFT-4D vs TFT-D3C = -13 : -13
1-∞/TFT-4D vs TFT-D3C = -13 : -13
1-∞/TFT-4D vs 1-∞/TFT-4D = +3 : -4

Which nets -27 : -32. However, as TFT-D3C always scores 1 point higher against TFT-nD and other TFT-DnC strategies than 1-∞/TFT-4D does, the winner of this duel will depend heavily on the pool of submitted strategies.

In any case, this concludes Composite strategies, so let's get on with finding some replacements for boring ol' TFT.



In the late game, TFT is successful because it doesn't defect first while its ability to retaliate becomes very unimportant except during the very last turns. On the other hand, TFT is successful in the early game because it doesn't let strategies like DefectBots take too much advantage of it while maximising points gained from other nice strategies. But maybe there are other strategies with these same qualities that don't turn into a bloody mess after one random defection or score higher against RandomBots? Here's a very interesting observation for all of you that no one seems to have noticed, and I wouldn't have noticed it either had I not been specifically looking for it. Anyway, this is the observation: In both round-robin tournaments of the control group, the highest finishing TFT-0D variant is C6. Any strategies that finished higher were either TFT-1D or TFT-2D variants. And what is C6?

It is a strategy that always forgives the opponent's first defection.

Had C6 defected on the last two turns, I suspect it would have dominated the tournament until the emergence of TFT-3D, i.e. won the 100 generations tournament. Had it been a forgiving TFT-D3C, it would have won the 1000 generations tournament. There were other strategies that had a chance of forgiving, but they did that on every defection, allowing DefectBots and RandomBots to trample all over them (like TF2T).

In order to maximise gain from RandomBots and other insane strategies, it might also be worth to switch to DefectBot after a total of three or two subsequent opponent's defections. For the sake of simplicity and three-letter acronyms I call this strategy CRD (Cooperate, Retaliate, Defect).

Should CRD prove to outperform TFT in the early game, any other strategy would get one early defection for free, which is pretty much parasite CliqueBot heaven. On the other hand, CRD strategies would be able to feed on any Random CliqueBots.


Final Remarks

This pretty much concludes my thoughts on the theoretical nature of the selective Iterated Prisoner's Dilemma. As I see it, the strategies with the highest chance of success are:

Efficient CliqueBots:
Might work if the correct host is chosen and no true parasites are present. If there is a good chance that other participants will come to the same conclusion regarding the host while it is unlikely for any of the strategy's parasites to be able to survive, it might be beneficial to experiment with TFT variants such as CRD in order to maximise early game growth. This is what gave I the lasting advantage over C4 in the thousand generations tournament.

Regular CliqueBots:
Might work if there is a high number of Efficient CliqueBots hindering each other's process, especially if there are also specialized parasites of those. Regular CliqueBots will also have an advantage if there are lots of forgiving strategies.

Parasite Killer Tandems:
Might work if the correct parasite is chosen as a host and no parasites of the parasite killer survive.

Random CliqueBots:
Will most likely work, except if there are early dominant Efficient CliqueBot strategies on which the Random CliqueBot cannot feed, or if dominant strategies are of the forgiving (CRD) kind.

Regular TFT-nD strategies will be exterminated by Efficient CliqueBots.

There also are a few general guidelines:

  • Any strategy needs to be carefully designed, which for (non-Efficient) CliqueBots includes forgiving after opponent retaliaton as well as updating the identity of the opponent in case of defections before or after the identification turn.
  • CliqueBots and Composites should not waste a single point when identifying clones, siblings and aliens.
  • Any strategy needs to score against any other strategy at least as high as any potential competitors score against that strategy, including most importantly the competitor itself.
  • Any strategy needs to score against itself as high as possible.
  • It is not necessary or important to win direct encounters if the guidelines above are followed.
  • The probability that I have made not a single arithmetic error in all of this post is pretty low, so double-checking the calculations relevant to the strategy in question seems rational.

Please also see this comment for graphical comparison of some of the discussed strategies.

Lastly, a few selected strategies written in pseudocode, with n being the number of turns per match:


Efficient CliqueBot: TFT-D3C

Cooperation on first turn.
Continue with TFT.
If opponent defects on any of turns 1 to n-4:
    Continue with TFT.
    Defect on turns n-1 and n.
    If opponent defects on any of turns n-5 to n:
        Defect until end.
    Defect on turn n-3.
    If opponent has defected on turn n-3:
        Continue with cooperation.
        If opponent defects any turn:
            Defect until end.
        Defect until end.


Regular CliqueBot: 1/TFT-2D

Defect on first turn.
Cooperate on second turn.
If opponent has defected on first turn and cooperated on second turn:
    Cooperate on third turn.
    Continue with TFT.
    If opponent defects on any of turns 3 to n:
        Defect on turns n-1 (if still possible) and n.
    If opponent has defected on both turns:
        Defect on third turn.
        Cooperate on third turn.
    Continue with TFT until turn n-2.
    Defect on turns n-1 and n.
If opponent defects on any of turns n-5 to n:
    Defect until end.


Random CliqueBot: 10-19/TFT-2D

Randomly pick an integer i from 10 to 19.
Cooperate on first turn.
Play TFT until turn 9.
If opponent has defected on any of turns 1 to 9:
    Continue with TFT.
    Defect on turns n-1 and n.
    Continue with cooperate until turn 19.
    If opponent has defected a total of two times:
        Continue with TFT.
        Defect on turns n-1 and n.
    Else if opponent has defected once before turn 19:
        Cooperate after opponent defection.
        Continue with TFT.
        Defect on turn i.
        Continue with cooperate.
        If opponent has defected on turn i:
            If opponent has cooperated on turn i+1:
                Continue with TFT.
                Continue with TFT.
                Defect on turns n-1 and n.
            If i < 19 and opponent has cooperated on turn i+1:
                Continue with TFT.
                If opponent defects:
                    Defect on turns n-1 and n.
                Continue with TFT.
                Defect on turns n-1 and n.
If opponent defects on any of turns n-5 to n:
    Defect until end.

New to LessWrong?

New Comment
14 comments, sorted by Click to highlight new comments since: Today at 5:39 AM

Nice analysis; upvoted. I think you missed a layer of the competition, though.

The game wasn't "produce the optimal strategy for this Iterated Prisoners Dilemma rule set". It was "produce a strategy that will defeat the strategies that Discussion-section-following LWers will imagine in response to a Discussion-level post". My strategy was planned around the idea that most respondents would anchor on Tit-for-Tat with a slight modification to demonstrate their cleverness.

That is true, however my analysis is only linked to the competition in that I want to give players the tools needed to construct successful strategies according to their own visions and determine which of these visions are any good, with little emphasis on the psychological part. Most of the submitted strategies didn't perform poorly because other strategies were falsely anticipated, but because they were simply poorly designed.

I consider the rules and guidelines in my analysis to be of far more importance than the actual strategies.

The next most obvious step is now, of course, to start another prisoner's dilemma tournament and see whether the strategies improved.

Have you tried testing your models by simulating a bunch of tournaments with various bot mixes and checking whether your predictions are confirmed? After all, this is the essence of rationality.

Sort of. I have not written any code that would allow me to pit actual algorithmic strategies against each other and see what happens. I did however write a deterministic program that allows me to simulate tournaments of strategies that are defined by how high they score against any strategy in the pool. None of the observations made contradicted any of the principles and theories (that I had devised beforehand), and nothing much else of interest was observed.

In the end, that program is little more than a calculator for a very complicated equation with lots of variables that can be broken down into smaller chunks which are pretty much the rules posited.

I have uploaded a few images of some test tournaments for visualization of these rules as well as your entertainment. Note that since I purposely didn't do any integer truncation, strategies are only actually extinct once there's a stable dominant strategy. Each image covers 1280 generations of 25-turn matches.

Initial setup; only TFT-nD with n ranging from 0 to 5 (corresponding to the digits on the graph) are present, each equally well represented. Obviously the highest n wins in the end.

Adding TFT-D3C (index 6), we see pretty much what we would have expected to see.

Adding TFT-D2CD (index 7), the parasite of TFT-D3C, we see of course TFT-D3C losing pretty badly, but we also see TFT-4D coming back from the dead because TFT-D2CD performs worse against itself then TFT-D3 does. Would you have predicted what happened next? (5120 generations)

Adding TFT-D4C (index 8), we see something similar but a lot faster, since TFT-D4C is pretty much TFT-5D on steroids.

Removing TFT-4D, parasite of TFT-3D and TFT-D2CD as well as host of TFT-5D and TFT-D4C, we see again TFT-D2CD triumphing because the link to the higher-n strategies has been severed.

And so on and back and forth and...

I wrote code, since I'd like to eventually test random and evolutionary models:

Next up is outputting results from a round robin, then figuring out rules for changing the population after each turn. Suggestions and forks are welcome.

I sketched an entry for the original contest while on vacation, but by the time I went to write it up (before Sept. 1!) submissions were closed. My sketch looks very similar to 18-87/TFT-2D, and (as I recall) the relevant parts of the reasoning that led me to it were:

  • a TFT variant will win, so I'll write a TFT variant
  • clearly the winner needs to beat TFT so I'll defect on the last turn
  • most people will defect on the last turn so maybe I'll defect on the last two turns
  • (I don't care about the elimination thing, only the evolutionary tournament)
  • given that I'm around in the last few generations, I will compete against me, so I'd like to not defect against myself in the last two turns
  • I'll pick some arbitrary turn to defect on like 56, and if I see that we both defected on 56 then I'll cooperate for the last two turns
  • ...but 1/1,4/4 is fewer points than 0/7,7/0 so it'd be better if I could defect on different turns against myself
  • fine, randomly between 50-80, and on turns 99-100 if my opponent acted like TFT except for a single defection, then I'll cooperate. Or okay, why not 1-95. No, people will probably do silly thing in the first few turns. And last few. 18-87 or something.

I'd like to see competitors' reasoning for their submissions.

Looks reasonable. However, point gain from increasing the range of i is logarithmic while the danger of opponents randomly (from your perspective) defecting within that range increases approximately linearly, so large ranges aren't optimal. I only used 1-∞/TFT-nD as an example so I wouldn't have to deal with decimal numbers.

My reasoning was pretty much exactly the same (only diverging slightly on the last bullet point), but I didn't do well due to the presence of vengence bots.

This statement is wrong:

Survival Rule: For A in this scenario not to go extinct, it must score at least equally high against X as X does against itself, and if it doesn't score higher, it must score at least equally high against itself as X does against itself while not losing direct encounters.

A population with a majority of DefectBots and a minority of TFT is a counterexample.

Thank you for pointing out what you perceive as an error.

However, this is not an actual counterexample to the rules. If TFT falls below a certain threshold as explained in the threshold rule, it will actually go extinct in this case. Let me shed a little more light on the issue of thresholds, which I have largely ignored in my post because of the cumbersome equations involved.

If A doesn't score higher against X than X does against itself, there trivially exists a minimum amount of A-strategies for which the point gain from A vs A encounters becomes irrelevantly small compared to point loss from A vs X, since the latter is at least 1 while the amount of A-strategies can be arbitrarily low with point gain from A vs A approaching 0. Knowing this, we can calculate the threshold in question; here exemplarily done for TFT (A) vs DefectBot (X) for 10-turn matches:

  • Points for A against itself (aa) = 40
  • Points for A against X (ax) = 9
  • Points for X against A (xa) = 16
  • Points for X against itself (xx) = 10

We define n as the threshold percentage of A in the pool, in which case the following is true (assuming a large enough pool):

  • n aa + (1 - n) ax = n xa + (1 - n) xx
  • n * (aa + xx - ax - xa) = xx - ax
  • n * 25 = 1
  • n = 0.04

So if TFT makes up less than 4% of the pool, it will actually go extinct. The main reason why this threshold is so low is because xx - ax is only 1, the smallest possible value.

I agree with your analysis, but you should update the rule; your present wording claims that the threshold should always be 50%.

Yes, it was not apparent from the survival rule alone that survival can still be achieved according to the threshold rule. It should be clear now.

Hmm, the space of plausible strategies here sounds like it has a rather smooth fitness landscape, it might be interesting to see the results of a real evolutionary tournament starting with a single strategy and having a chance of mutation into a similar strategy.