Download presentation

Presentation is loading. Please wait.

Published byAliyah Dapp Modified over 4 years ago

1
Design of Multi-Agent Systems Teacher Bart Verheij Student assistants Albert Hankel Elske van der Vaart Web site http://www.ai.rug.nl/~verheij/teaching/dmas/ (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...

10
Semi-finals Matthijs Marnix Dimitri Harmen Mark Peter

13
Final Harmen vs Matthijs

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

OK

Design of Multi-Agent Systems Teacher Bart Verheij Student assistants Albert Hankel Elske van der Vaart Web site

Design of Multi-Agent Systems Teacher Bart Verheij Student assistants Albert Hankel Elske van der Vaart Web site

© 2018 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google