We consider the social norms of repeated matching games in the presence of finite probability trembles and show that such norms must be subgame perfect along the equilibrium path but need not be subgame perfect off the equilibrium path. This is consistent with the well known experimental results...

This paper describes the results of simulation experiments performed on a suite of learning algorithms. We focus on games in network contexts. These are contexts in which (1) agents have very limited information about the game; users do not know their own (or any other agent's) payoff function,...

We present the results of an experiment on learning in a continuous-time low-information setting. For a dominance solvable version of a Cournot oligopoly with differentiated products, we find little evidence of convergence to the Nash equilibrium. In an asynchronous setting, characterized by...