A Study of Prisoner’s Dilemma Game Model with Incomplete Information

Algorithm 3

procedure strategy()

 if tem_turn <TURN_THRESHOLD then

  decision random(choice_space)

 else

  prediction_list predict(restore)

  for each choice  do

   profit[]

profit_expect(, prediction_list)

  end

end

  decision arg(max(profit))

 return decision

end

procedure update( feedback ):

 storage.add(feedback)