Design of Multi-Agent Systems

TeacherBart Verheij

Student assistantsAlbert HankelElske van der Vaart

Web sitehttp://www.ai.rug.nl/~verheij/teaching/dmas/

(Nestor contains a link)

The prisoner’s dilemma tournament

The prize (which hasn’t arrived yet …)

The prisoner’s dilemma tournament

6 pools, 2 semi-finals, 1 final

One player was disqualifiedSome strategies were submitted several timesSome rounds were won by ‘penalties’ (i.e., actually

a draw)Some strategies used the code creatively (but did

not win)The winner submitted a strategy designed using

false assumptions ...The winner was really a TIT-FOR-TAT clone ...

Semi-finals

MatthijsMarnixDimitri

HarmenMarkPeter

Final

Harmenvs

Matthijs

The winner’s code

if(strategy.equals("MATTHIJS")) { int count = 0; int atmost = encounters; if(atmost >= 10) atmost = 9; for(int i = 0; i < atmost; ++i) { if(memory[playerID][i]) count++; } double ratio = (double)count / ((double)atmost + 1.0); if(ratio < 0.4) {//vaak defect, dan zelf ook defect return false; } else if(ratio > 0.8) {//vaak cooperate dus zelf ook cooperate return true; } else {//TIT-FOR-TAT if(encounters <= 0) { action = true; } else { action = memory[playerID][0]; } } }