Decentralized matching markets on the internet allow large numbers of agents to interact anonymously at virtually no cost. Very little information is available to market participants and trade takes place at many different prices simultaneously. We propose a decentralized, completely uncoupled...

We study experimentally whether heterogeneity of behavior in the Centipede game can be interpreted as the result of a learning process of individuals with different preference types (more and less pro-social) and coarse information regarding the opponent's past behavior. We manipulate the...

We study experimentally whether heterogeneity of behavior in the Centipede game can be interpreted as the result of a learning process of individuals with different preference types (more and less pro-social) and coarse information regarding the opponent's past behavior. We manipulate the...

This note applies the evolutionary dynamic of Kandori, Mailath, and Rob ( Econometrica 61 (1993), 29-65) to class coordination games that the entire population plays simultaneously. In these games, payoffs and best replies are determined by a symmary statistic of the population strategy profile...

We examine the realism of the assumption of self-interested opportunism in agency theory. We place subjects into manager/producer pairs and set parameters so that the producer extracts the highest share of residual earnings from the manager by setting the budget at zero (100% slack) and...

In this paper we investigate how cognitive ability influences behavior, success and the evolution of play towards Nash equilibrium in repeated strategic interactions. We study behavior in a p-beauty contest experiment and find striking differences according to cognitive ability: more cognitively...

We study evolutionary learning processes through social networks. We show that network heterogeneity, in particular scale-freeness, enhances social learning by studying a model in which an agent set on a network imitates the strategy only from the neighborhood. Further, in order to determine...

This article tries to connect two separate strands of literature concerning genetic algorithms. On the one hand, extensive research took place in mathematics and closely related sciences in order to find out more about the properties of genetic algorithms as stochastic processes. On the other...

We study the intergenerational accumulation of knowledge in an infinite-horizon model of communication. Each in a sequence of players receives an informative but imperfect signal of the once-and-for-all realization of an unobserved state. The state affects all players' preferences over present...

We introduce the algorithmic learning equations (ALEs), a set of ordinary differential equations which characterizes the finite-time and asymptotic behaviour of the stochastic interaction between state-dependent learning algorithms in dynamic games. Our framework allows for a variety of...