It is known that there are uncoupled learning heuristics leading to Nash equilibrium in all finite games. Why should players use such learning heuristics and where could they come from? We show that there is no uncoupled learning heuristic leading to Nash equilibrium in all finite games that a...

It is known that there are uncoupled learning heuristics leading to Nash equilibrium in all finite games. Why should players use such learning heuristics and where could they come from? We show that there is no uncoupled learning heuristic leading to Nash equilibrium in all finite games that a...

This paper aspires to fill a conspicuous gap in the literature regarding learning in games — the absence of empirical verification of learning rules involving pattern recognition. Weighted fictitious play is extended to detect two-period patterns in opponents’ behavior and to comply with the...

This paper uses a laboratory experiment to study beliefs and their relationship to action and strategy choices in finitely and indefinitely repeated prisoners' dilemma games. We find subjects' beliefs about the other player's action are accurate despite some systematic deviations corresponding...

This paper uses a laboratory experiment to study beliefs and their relationship to action and strategy choices in finitely and indefinitely repeated prisoners' dilemma games. We find subjects' beliefs about the other player's action are accurate despite some systematic deviations corresponding...

We consider mixed populations (N=21) of genuine (humans) and artificial (robots) agents, repeatedly interacting in small groups whose composition is changed randomly from round to round. Our purpose is to study the spread of cooperative or non-cooperative behavior in the population over time by...

We investigate whether two players in a long-run relationship can maintain cooperation when the details of the underlying game are unknown. Specifically, we consider a new class of repeated games with private monitoring, where an unobservable state of the world influences the payoff functions...

We propose an extension to smooth fictitious play and prove that play converges to an ε-Markov perfect equilibrium with probability one in a class of stochastic games known as Markov potential games. We then prove a partial Folk theorem for repeated games under one-period perfect monitoring. We...

This paper investigates the way in which adaptive players behave in the long run in finitely repeated games. Each player assigns subjective payoff assessments to his own actions and chooses the action which has the highest assessment at each of his information sets. After receiving payoffs,...

This paper reports results of a 100-round Yes-No game experiment conducted under the random matching protocol. In contrast to ultimatum bargaining, the responder in the Yes-No game decides whether to accept without knowing the proposer’s offer. Although both games have the same solution...