Eliezer_Yudkowsky comments on Prisoner's Dilemma (with visible source code) Tournament - Less Wrong

47 Post author: AlexMennen 07 June 2013 08:30AM

You are viewing a comment permalink. View the original post to see all comments and the full post content.

Comments (232)

You are viewing a single comment's thread. Show more comments above.

Comment author: shminux 05 June 2013 11:13:33PM 3 points [-]

There is a fair possibility that a number of programs whose dominant strategy is "cooperate with other dominant cooperators, do something else otherwise" (what ThrustVectoring calls AbsolutismBot "wrapper") will end up sharing the top spot with the same number of points. I wonder if it makes sense to discourage this approach in some way.

Comment author: Eliezer_Yudkowsky 06 June 2013 03:57:43AM 6 points [-]

Why isn't this just a fair result?

Comment author: Decius 09 June 2013 03:17:47AM 2 points [-]

No person may contribute to more than one entry.

I'm pretty sure that incorporating code written by someone else into your entry qualifies. I think the highest single entry might be to cheat and make everyone think you are in that tribe but defect anyway, or it might be dominant to defect against any program displaying tribal affiliations (other than this new tribe, of course). The dominant tribe is the tribe with the most members and best tribal identification, not the tribe with the best way of judging an opponents intentions.

Comment author: JDM 09 June 2013 03:55:49AM 0 points [-]

There is a difference between a "tribe system" as mentioned by yourself and one person winning by submitting 1000 entries. The goal as I understand it is simply to maximize your score by whatever means possible, not accurately guess your opponents intentions.

Comment author: shminux 06 June 2013 07:43:45AM 0 points [-]

It is certainly fair, but in a situation where, say, there is only one escape pod available, you still have to fight it out with others. What I had in mind is to make this more adversarial if the obvious and boring approach is full or nearly full cooperation.

Comment author: Eliezer_Yudkowsky 06 June 2013 08:58:03AM 4 points [-]

I don't think anyone disputes that in zero-sum games you play the Nash equilibrium move.

Comment author: shminux 06 June 2013 03:55:42PM -1 points [-]

Sorry, I do not follow. Are you saying that there is a guaranteed best strategy in the winner-takes-all case? And that "cooperate with clones, defect against everyone else" is it?

Comment author: bogdanb 07 June 2013 07:14:38PM 3 points [-]

In winner takes all, you can’t cooperate and win, because “cooperate” implies you didn’t take it all.

Comment author: shminux 07 June 2013 09:35:00PM *  0 points [-]

You can still do better than your almost-clones if the difference is in how you play detected non-clones or non-clones misdetected as almost-clones.

Comment author: bogdanb 07 June 2013 11:01:08PM *  1 point [-]

“Winner takes all” doesn’t have “do better”. You either take it all or you have nothing at all. If you didn’t win you didn’t do any better than a painted rock.

I think we don’t mean the same thing when we say “winner takes all”. (BTW, I only just noticed you used that phrase in reply to a comment where Eliezer uses “zero-sum games”, which is not at all the same thing. In a ZSG, me and a buddy can band together, steal your money, and split between ourselves. In WTA I have to fight my ally, I can’t share with him.)

Comment author: shminux 07 June 2013 11:29:42PM 2 points [-]

I probably misunderstand what you mean. People temporarily cooperate all the time even if all of them know that in the end "there can be only one". It may be advantageous to band with your near-clones and hope that you are better than them when dealing with others, thus gaining a decisive edge.

Comment author: bogdanb 15 June 2013 08:14:13PM *  2 points [-]

OK, I got it. (It helps if you look at the single thread, and click on "Show more comments above." to see the entire chain.)

This contest is supposed to rank strategies for iterated PD. Your one-escape-pod comment suggests you are interested in a contest that finds the winner stategy when there can be a single winner. That would be a very different kind of contest, though supperficially similar.

Obviously, a ranking contest can be transformed into a winner-picking contest, by declaring the first-ranked candidate the winner, if there is a mechanism for enforcing the lack of ties for first place. This mechanism is not necessarily easy to add unless the contest is designed for it from the beginning, and since there are lots of possible ranking methods it is probably often impossible.

But due to the superficial similarity (and perhaps an abuse of technical language), I think the distinction between what this contest does and what you wanted it to do was lost somewhere in your initial exchange with Eliezer.

Of course, what you say about temporary cooperation is perfectly correct. I think our terminology misunderstanding stems from the perspective, I was more focused on the entire contest (which is more adversarial, as the goal is the be ranked above others), and I believe you were focusing on the individual encounters (which are slightly more cooperative, since mutual destruction is very bad). We probably don’t disagree on what the words mean, we were just thinking of different issues.

(This is a constant danger when discussing games composed of other games (e.g. the iterated tournament), so we should probably have been more explicit. In retrospective Eliezer using the word “fair” should have been a warning everyone is talking about different things...)