Prisoner

1
Prisoners Dilemma with N-Participants and
Optional Cooperation

• By Matt Lee
• Computer Systems Lab
• 2007-2008

2
Background

• Prisoners Dilemma-A non-zero sum game where the
  objective is to have maximum (or minimum) payoff
• Normally played with two prisoners that have only
  two options, to cooperate or to defect. Doing so
  yields different amounts depending on the results
  of both prisoners

3
Second Quarter

• Enabled multiple prisoners playable
• Could use a limited number of strategies
• New methods added to make the strategy Tit for
  Tat more efficient.

4
Third Quarter

• Prisoners engage in rounds against each other.
• All of them engage at least once in each round of
  play of Prisoners Dilemma
• Fixed up the foresight of the first player
• Worked on Graphical Display

5
Interesting Research

• The Turn-Taking Dilemma by Daniel Neil
• Follows general guideline stats of Prisoners
  Dilemma, including the payoff stats.
• Determined that the optimal strategies used for
  Iterated Prisoners Dilemma werent useful for
  the Turn-Taking Dilemma. It was used to
  determine coordination of when some people should
  cooperate, and in the end, determined that this
  model is more realistic since it applies the
  aspect of compromise of short term losses for
  long term gains

6
Future

• Analysis
• Finalize Graphic Display
• Fix anything that comes up (One apparent is
  ensuring that each prisoner plays against each
  other only once)?
• Employ the Optional Cooperation bit.