We study the coevolution of networks and action choices in a Prisoners' Dilemma. Agents in our model learn about both action choices and choices of interaction partners (links) by imitating successful behavior of others. The resulting dynamics yields outcomes where both cooperators and defectors...

We conduct a repeated VCM (voluntary contribution mechanism) experiment using the strategy method and compare contribution behavior in a partner and a stranger matching in both a cold and a hot setting, where the latter differs from the former by allowing participants to revise their strategies...

Delaying acceptance decisions in the Ultimatum Game drastically increases acceptance of low offers. While in treatments without delay less than 20% of low offers are accepted, 60-80% are accepted as we delay the acceptance decision by around 10 min.

Abstract We experimentally investigate the effect of endogenous matching within a segmented population on peoples' willingness to cooperate as well as their attitudes towards cooperative norms. In the experiment participants can repeatedly choose between two groups, where in one of them a...

This paper studies the learning process carried out by two agents who are involved in many games. As distinguishing all games can be too costly (require too much reasoning resources) agents might partition the set of all games into categories. Partitions of higher cardinality are more costly. A...

We conduct a laboratory experiment and provide evidence of learning spillovers within and across equivalence classes of “structurally similar” games. These spillovers are inconsistent with existing theories of learning in games.

We present a model of adaptive economic agents who are k periods forward looking. Agents in our model are randomly matched to interact in finitely repeated games. They form beliefs by learning from past behavior of others and then best respond to these beliefs looking k periods ahead. We...

We study how players learn to make decisions if they face many different games. Games are drawn randomly from a set of either two or six games in each of 100 rounds. If either there are few games or if extensive summary information is provided (or both) convergence to the unique Nash equilibrium...