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

Fictitious play is the oldest and most studied learning process for games. Since the already classical result for zero-sum games, convergence of beliefs to the set of Nash equilibria has been established for some important classes of games, including weighted potential games, supermodular games...

Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly take the network structure as fixed. In many situations, however, the network structure can be altered by players. This means that the value of alternative network structures (not just sub-networks)...

We show in this paper that none of the existing static evolutionary stability concepts (ESS, CSS, uninvadability, NIS) is sufficient to guarantee dynamic stability in the weak topology with respect to standard evolutionary dynamics if the strategy space is continuous. We propose a new concept,...

I survey the recent literature on the formation of networks. I provide definitions of network games, a number of examples of models from the literature, and discuss some of what is known about the (in)compatibility of overall societal welfare with individual incentives to form and sever links.

We study Nash equilibria of joint production games under a mixed output sharing rule in which part of the output (the mixing parameter) is shared in proportion to inputs and the rest according to exogenously determined shares. This rule includes proportional sharing and equal sharing as special...

Strategic games are considered where the players derive their utilities from participation in certain 'processes.' Two subclasses consisting exclusively of potential games are singled out. In the first, players choose where to participate, but there is a unique way of participation, the same for...

Folk Theorems in repeated games hold fixed the game payoffs, while the discount factor is varied freely. We show that these results may be sensitive to the order of limits in situations where players move asynchronously. Specifically, we show that when moves are asynchronous, then for a fixed...

This paper examines the issue of multiplicity of equilibria in alternating move repeated games with two players. Such games are canonical models of environments with repeated, asynchronous choices due to inertia or replacement. We focus our attention on Markov Perfect equilibria (MPE). These are...

We propose a new and simple adaptive procedure for playing a game: "regret-matching." In this procedure, players depart from their current play with probabilities that are proportional to measures of regret for not having used other strategies in the past. It is shown that our adaptive procedure...