In repeated public good experiments, reciprocity helps to sustain high levels of cooperation. Can this be achieved by location choices in addition to making contributions? It is more realistic to rely on an intuitive neighborhood model for community members who interact repeatedly. In our...

In repeated public good experiments, reciprocity helps to sustain high levels of cooperation. Can this be achieved by location choices in addition to making contributions? It is more realistic to rely on an intuitive neighborhood model for community members who interact repeatedly. In our...

In repeated public good experiments, reciprocity helps to sustain high levels of cooperation. Can this be achieved by location choices in addition to making contributions? It is more realistic to rely on an intuitive neighborhood model for community members who interact repeatedly. In our...

This paper provides a new way to identify conditional cooperation in a real-time version of the standard voluntary contribution mechanism. We define contribution cycles as the number of contributors a player waits for before committing to a further contribution, and use a permutation test on...

This paper provides a new way to identify conditional cooperation in a real-time version of the standard voluntary contribution mechanism. We define contribution cycles as the number of contributors a player waits for before committing to a further contribution, and use a permutation test on...

This paper provides a new way to identify conditional cooperation in a real-time version of the standard voluntary contribution mechanism. We define contribution cycles as the number of contributors a player waits for before committing to a further contribution, and use a permutation test on...

We analyze dynamic local interaction in population games where the local interaction structure (modeled as a graph) can change over time: A stochastic process generates a random sequence of graphs. This contrasts with models where the initial interaction structure (represented by a deterministic...

We analyze dynamic local interaction in population games where the local interaction structure (modeled as a graph) can change over time: A stochastic process generates a random sequence of graphs. This contrasts with models where the initial interaction structure (represented by a deterministic...

We analyze dynamic local interaction in population games where the local interaction structure (modeled as a graph) can change over time: A stochastic process generates a random sequence of graphs. This contrasts with models where the initial interaction structure (represented by a deterministic...

Our study analyzes theories of learning for strategic interactions in networks. Participants played two of the 2 × 2 games used by Selten and Chmura [1]. Every participant played against four neighbors. As a distinct aspect our experimental design allows players to choose different strategies...