We consider a model of an information network where nodes can fail and transmission of information is costly. The formation of paths in such networks is modeled as the Nash equilibrium of an N player routing game. The task of obtaining this equilibrium is shown to be NP-Hard. We derive...

This paper analyzes the effect of the availability of information about the payoff structure on the behavior of players in a Common-Pool Resource game. Six groups of six individuals played a complete information game, while other six groups played the same game but with no information about the...

Recently there has been much theoretical and experimental work on learning in games. However, learning usually means learning about the strategic behavior of opponents rather than learning about the game as such. In contrast, here we report on an experiment designed to test whether players learn...

Two subjects have to repeatedly choose between two alternatives, A and B, where payoffs of an A or B-choice depend on the choices made by both players in a number of previous choices. Locally, alternative A gives always more payoff than alternative B. However, in terms of overall payoffs...

Early results of evolutionary game theory showed that the risk dominant equilibrium is uniquely selected in the long run under the best-response dynamics with mutation. Bergin and Lipman (1996) qualified this result by showing that for a given population size the evolutionary process can select...

We study a strategic model of dynamic trading where agents are asymmetrically informed over common value sources of uncertainty. There is a continuum of buyers and a finite number n of sellers. All buyers are uninformed, while at least one seller is privately informed about the true state of the...

A learning rule is uncoupled if a player does not condition his strategy on the opponent's payoffs. It is radically uncoupled if a player does not condition his strategy on the opponent's actions or payoffs. We demonstrate a family of simple, radically uncoupled learning rules whose...

We consider a Bayesian persuasion problem where the persuader and the decision maker communicate through an imperfect channel that has a fixed and limited number of messages and is subject to exogenous noise. We provide an upper bound on the payoffs the persuader can secure by communicating...

We address the problem of learning and implementation on the Internet. When agents play repeated games in distributed environments like the Internet, they have very limited {\em a priori} information about the other players and the payoff matrix, and the play can be highly asynchronous....