This paper consider the dynamic evolution of algorithmic (recursive) learning rules in a normal form game. It is shown that the system - the population frequencies - is globally stable for any arbitrary N-player normal form game, if the evolutionary process is algorithmic and the `birth process'...

We ask whether communication can directly substitute for memory in dynastic repeated games in which short lived individuals care about the utility of their offspring who replace them in an infinitely repeated game. Each individual is unable to observe what happens before his entry in the game....

We identify and investigate the basic `hold-up' problem which arises whenever each party to a contingent contract has to pay some ex-ante cost for the contract to become feasible. We then proceed to show that, under plausible circumstances, a `contractual solution' to this hold-up problem is not...

This paper suggests a reason, other than asymmetric information, why agency contracts are not explicitly contingent on the agent's performance or actions. Two ingredients are essential to this reason. The first is the written form that contracts are required to take to be enforceable. The second...

A canonical interpretation of an infinitely repeated game is that of a “dynastic” repeated game: a stage game repeatedly played by successive generations of finitely-lived players with dynastic preferences. These two models are in fact equivalent when the past history of play is observable...

This paper provides a theory of equilibrium selection for one-shot two- player finite-action strategic-form common interest games. A single round of costless unlimited pre-play communication is allowed. Players are restricted to use strategies which are computable in the sense of Church's...