Download presentation

Presentation is loading. Please wait.

Published byAliyah Dapp Modified over 2 years ago

1
Design of Multi-Agent Systems Teacher Bart Verheij Student assistants Albert Hankel Elske van der Vaart Web site (Nestor contains a link)

2
The prisoner’s dilemma tournament The prize (which hasn’t arrived yet …)

3
The prisoner’s dilemma tournament 6 pools, 2 semi-finals, 1 final One player was disqualified Some strategies were submitted several times Some 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...

4

5

6

7

8

9

10
Semi-finals Matthijs Marnix Dimitri Harmen Mark Peter

11

12

13
Final Harmen vs Matthijs

14

15
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]; }

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google