We examine convergence behavior in simple bimatrix games. We classify possible types of simple games, pick interesting examples of each type, and summarize convergence behavior under various information and player matching protocols.

This paper extends several existing learning models to investigate their fixed points (their long run predictions of play). The fixed points of the model are not necessarily at the Nash equilibria of the payoff matrices but are a function of both the Nash equilibria and the parameters of the...

Experimental data is used to test a variety of learning models using a model that extends several of the existing learning models. Generally, the parameter estimate are in the expected ranges. Individual agent parameter estimates indicate that there is considerable individual heterogeneity....