The best shot game applied to networks is a discrete model of many processes of contribution to local public goods. It has generally a wide multiplicity of equilibria that we refine through stochastic stability. In this paper we show that, depending on how we define perturbations, i.e. the...

We show that for many classes of symmetric two-player games, the simple decision rule "imitate-the-best" can hardly be beaten by any other decision rule. We provide necessary and sufficient conditions for imitation to be unbeatable and show that it can only be beaten by much in games that are of...

We study a communication game of common interest in which the sender observes one of infinite types and sends one of finite messages which is interpreted by the receiver. In equilibrium there is no full separation but types are clustered into convex categories. We give a full characterization of...

We report experiments designed to test between Nash equilibria that are stable and unstable under learning. The “TASP” (Time Average of the Shapley Polygon) gives a precise prediction about what happens when there is divergence from equilibrium under fictitious play like learning processes....

The rate of deployment and adoption issues of new network technologies, IPv6 in particular, have recently been hotly debated in the research community. However, the question of how protocols migrate, especially the dynamics of migration, to new paradigms is still largely open. In this paper, we...

Saez-Marti and Weibull [4] investigate the consequences of letting some agents play a myopic best reply to the myopic best reply in Young's [8] bargaining model. This is how they introduce "cleverness" of players. We analyze such clever agents in general finite two-player games. We show that...

Intuitively, we expect that players who are allowed to engage in costless communication before playing a game would be foolish to agree on an inefficient equilibrium. At the same time, however, such preplay communication has been suggested as a rationale for expecting Nash equilibrium in...

We propose a learning dynamic with agents using samples of past play to estimate the distribution of other players' strategy choices and best responding to this estimate. To account for noisy play, estimated distributions over other players' strategy choices have full support in the other...

This paper shows that asynchronicity of moves can lead to a unique prediction in coordination games, in an infinite-horizon setting, under certain conditions on off-equilibrium payoffs. In two-player games we derive necessary and sufficient conditions for play ultimately being absorbed in the...