Prisoner

1
Prisoners Dilemma with N-Participants and
Optional Cooperation

• Matt Lee
• Period 5
• Computer Systems Lab

2
Background

• Prisoners Dilemma-A Non-Zero Sum game where the
  objective is to simply have the maximum payoff .
• There are only two decisions, cooperate or
  defect.
• Depending on the output of the two participants,
  different values will be given.

3
First Quarter

• Retrofitted an arrayList to keep track of
  prisoners and decisions.
• Two prisoners able to play using random algorithm

4
Right Now

• Prisoners able to use strategies
• Tit for Tat variations usable
• A prototype version of one variation is usable.
• New methods have been added to the Prisoner
  class, particularly the one to see the previous
  decision and hold it.

5
Research

• Netlogos Prisoners Dilemma with
  N-participants has an interesting way to do PD.
• Simulates entire world and encounters in PD
  situations.

6
Future

• Implement a variation of the N-participant from
  netlogo
• Implement/test more strategies
• Look over an interesting bit of code.

7
TFT (Semi-purely by accident)

• if(turn!0)
  while(runltsize)
  if(run!IDtag)
  Boolean desu(Boolean)list.get(run)
  boolean desu2desu.booleanValue()
  if(desu2false)
  falsers else
  if(desu2true) truers
  run
  if(falsersgttruers)
  player.setDecision(false)
  else if(falserslttruers)
  player.setDecision(true)
  else player.setDecision(true)
  /while(counterltsize)
  prisoner player2(prisoner)
  list.get(counter) if(player2player)
  break
  else
  boolean oppDeciplayer2.getDecision()
  player.setDecision(oppDeci)
  /