In this paper we use a differential game analysis to study the dynamic strategic interaction between a criminal gang extorting money from local shop-owners and the local police force. In particular, we are interested in characterizing which factors are important in determining whether the...

We analyze different ways of pairing agents in a bipartite matching problem, with regard to its scaling properties and to the distribution of individual ``satisfactions''. Then we explore the role of partial information and bounded rationality in a generalized {\it Marriage Problem}, comparing...

Most economic models implicitly or explicitly assume that interactions between economic agents are 'global' - in other words, each agent interacts in a uniform manner with every other agent. However, localized interactions between microeconomic agents are a pervasive feature of reality. What are...

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...

The standard model of repeated games assumes perfect synchronization in the timing of decisions between the players. In many natural settings, however, choices are made synchronously so that only one player can move at a given time. This paper studies a family of repeated settings in which...

In games with strict strategic complementarities, properly mixed Nash equilibria--equilibria that are not in pure strategies--are unstable for a broad class of learning dynamics.

This paper applies the theory of equilibrium in mixed strategies in an inspection game model to describe the strategic interaction in the stolen base play in baseball. A parsimonious simultaneous-move game model offers predictions about how the observable conduct of the teams on offense and...

We analyze a repeated first-price auction in which the types of the players are determined before the first round. It is proved that if every player is using either a belief-based learning scheme with bounded recall or a generalized fictitious play learning scheme, then for sufficiently large...