The issue of social justice is addressed in game theory presented in "prisoner's dilemma". Both players are better off if both cooperate and remain silent. The dilemma arises because one can gain an advantage by betraying the other, however, that backfires if both decide to betray each other.
An even more insightful game of social strategy was developed from the prisoner's dilemma game by Robert Axelrod. He created an artificial intelligence tournament (IPD Tournament) where computer programs were set up to play the game repeatedly. Past experience through repeated playing of the game added a new level of social considerations. Axelrod analyzed the top-scoring strategies and outlined several conditions that were necessary for a strategy to be successful over time: being nice initially, retaliating whenever betrayed, forgiving in order not to get stuck in an endless cycle of revenge, and being non-envious because the most successful strategy--being nice--makes it impossible to score more than the other player. Axelrod found that over many repetitions of the game with different strategies, greedy strategies tended to do very poorly and more altruistic strategies did best. Using this model, he theorized about "the evolution of altruistic behavior from mechanisms that are initially purely selfish." This game theory model has also been applied to learning theory such as the development of trust and cooperation within groups. Axelrod wrote The Evolution of Cooperation and its sequel, The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration.
Read the Wikipedia article Prisoner's Dilemma
Read the Wikipedia article The Evolution of Cooperation
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment