Iterated Games

Often players in a scenario that can be modeled as a strategic form game engage in repeated interactions with each other. In such instances, their selection of a strategy on a given "iteration" may depend on their history of previous interactions. By way of example, a player might start by playing strategy 1 and continue playing it unless the history of interactions were such that the opposing player had played 0 on his/her last two turns. This Demonstration permits a selection for each player from the 2,097,152 (2^21) strategies that depend on the prior two interactions of the players. It shows the resulting "directed graph" of histories the players could observe, the steady-state cycle of histories that will be observed, the payoffs from the selected strategic form game, and the mean payoffs received by the players in the steady state.

(30 lines omitted)

Histories that are part of the steady-state cycle are shown as framed.
There are 2^42 (≈ 4.4 trillion) possible strategy combinations that the players can employ in this game and that can be selected using the two top sliders.
A "tit-for-tat" strategy can be implemented by having player 1 use strategy 1398101 and by having player 2 use strategy 1973785.
comments
 
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed.
Privacy Policy »

Note: To run this Demonstration you need the free
Mathematica Player
or Mathematica 7+
Download or upgrade to Mathematica Player 7
I already have Mathematica Player or Mathematica 7+