Centre for Modeling and Simulation
Savitribai Phule Pune University All Models Are False, Some Are Useful

Bhalchandra Pujari

Bhalchandra  Pujari
UGC - Assistant Professor    

bspujari @

(+91 20).2569.0842
(+91 20).2560.1448
Extension : 207
Campus: 1448

Overview of Modeling and Simulation -I

Modeling and simulation (M&S) is getting information about how something will behave without actually testing it in real life ... M&S is a discipline on its own ... To ensure that the results of simulation are applicable to the real world, the engineering manager must understand the assumptions, conceptualizations, and implementation constraints of this emerging field.

Repeated Prisoners' Dilemma


  1. Think about the possible algorithm(s) for the Repeated Prisoner's Dilemma, and email them to me.
        Deadline : 05 Feb 2016
  2. Submit just the function(s) containing your algorithm. Do not send entire code, just a file(s) containing the code for your algorithm. Please remember the constraints explained in the class. (Make sure that your code is bug free.)
        Deadline : 15 Feb 2016

Groups and their algorithms

# Members Algorithm Subroutine Report
G1. CMS1501, CMS1510 Step 1: Start with C. Step 2: Go on cooperating till the opponents defects and thereafter defects for the remaining rounds. Download
G2. CMS1512 CMS1502 1. return 'C' at first step 2. henceforth, at each round calculate the two scores: OurScore and TheirScore. 3. if OurScore > TheirScore, return 'C' 4. if OurScore = TheirScore return random choice 5. if OurScore < TheirScore return 'D' Download
G3. CMS1509 CMS1504 CMS1329 step 1: Start with 'D'. step 2: Defect unless the opponent choose to co-operate twice in a row. step 3: When opponent co-operates twice in a row then we also co-operate. otherwise we will stick to defect. step 4: If opponent choose to co-operate continuously then we count number of co-operations, for even numbers we will co-operate and for odd number of co-operations we choose defect. Download
G4. CMS1506 CMS1507 (1) If No of iterations > 18 then first five options will be 'C','D','C','C','C' After this continue with 'D' till end (2)If No of iterations < 18 then first four options will be 'C','C','D','D' After this continue with 'D' till end Download
G5. CMS1503 CMS1508 Step 1: Start with 'C' Step 2: Check opponent response. if it is 'C' then 'C' or vice versa. Step 3: Continue this TFT(Tit for Tat) strategy for next 2 rounds. Step 4: At step five algorithm will check the probability of 'C' and 'D' of the opponent. Whichever will be with highest probability we will play that in 5th round.If both probability are equal then algorithm will give 'D' Step 5: if in fifth round opponent will give 'D' then algorithm will continue with 'D' till end of the round Download
G6. CMS1505 CMS1513 Start with co-operation. Continue three co-operations. If opponent co-operates for third take, then continue co-operation. Else defect for further steps. If opponent show co-operation for two continue steps then co-operate further. If game is of greater than 15-steps place co-operative mouse on 3/4 steps of total steps. If opponent co-operate then co-operate or defect upto end. Download
G7. CMS1515 CMS1511 Start with D. See opponents response. Defect until opponent choose to cooperate even no of times. Then start cooperating twice. If opponent is defecting then keep on defecting up to last round. Download
G8. CMS1402 Start with C. See opponents response.if counting C's of opponent less than and counting D's of opponent than take C else take D. Download

Reference material

Wikipage on Prisoner's dilemma

Model that we are going to talk about is 'Repeated Prisoner's Dilemma'. It is highly advisable to watch the following documentary by Richard Dawkins:

About | People | Programmes | ResearchReports
Alumni | Announcements | WebMail | Contact

© 2004-17 Centre for Modeling and Simulation
Valid HTML 4.01!