This paper studies fictitious play in networks of noncooperative two-person games. We show that continuous-time fictitious play converges to the set of Nash equilibria if the overall n-person game is zero-sum. Moreover, the rate of convergence is 1/T, regardless of the size of the network. In...

This paper studies fictitious play in networks of noncooperative two-player games. We show that continuous-time fictitious play converges to Nash equilibrium provided that the overall game is zero-sum. Moreover, the rate of convergence is 1/T , regardless of the size of the network. In contrast,...

This paper studies the evolution of peoples' models of how other people think - their theories of mind. First, this is formalized within the level-k model, which postulates a hierarchy of types, such that type k plays a k times iterated best response to the uniform distribution. It is found...

We report experiments designed to test between Nash equilibria that are stable and unstable under learning. The 'TASP' (Time Average of the Shapley Polygon) gives a precise prediction about what happens when there is divergence from equilibrium under fictitious play like learning processes. We...

We use an experiment to explore how subjects learn to play against computers which are programmed to follow one of a number of standard learning algorithms. The learning theories are (unbeknown to subjects) a best response process, fictitious play, imitation, reinforcement learning, and a trial...

We use an experiment to explore how subjects learn to play against computers which are programmed to follow one of a number of standard learning algorithms. The learning theories are (unbeknown to subjects) a best response process, fictitious play, imitation, reinforcement learning, and a trial...

We use an experiment to explore how subjects learn to play against computers which are programmed to follow one of a number of standard learning algorithms. The learning theories are (unbeknown to subjects) a best response process, fictitious play, imitation, reinforcement learning, and a trial...

We prove that, in all finite generic extensive-form games of perfect information, a continuous-time best response dynamic always converges to a Nash equilibrium component. We show the robustness of convergence by an approximate best response dynamic: whatever the initial state and an allowed...

We consider a specific parametric version of Chicken and two different correlation devices, public and private, with the same expected payoffs in equilibrium, which is also the best correlated equilibrium payoff for the game. Despite our choices of parameters (payoffs) in the game, in an...

While people often avoid learning about negative social consequences of their actions in order to behave selfishly, many social situations involve another person who is in a position to impose this information. How does the presence of a potential informer affect information, behavior, and...