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

We study how subjects in an experiment use different forms of public information about their opponents' past behavior. In the absence of public information, subjects appear to use rather detailed statistics summarizing their private experiences. If they have additional public information, they...

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

Two individuals are involved in a conflict situation in which preferences are ex ante uncertain. While they eventually learn their own preferences, they have to pay a small cost if they want to learn their opponent's preferences. We show that, for sufficiently small positive costs of information...

A strategy profile of a game is called robustly stochastically stable if it is stochastically stable for a given behavioral model independently of the specification of revision opportunities and tie-breaking assumptions in the dynamics. We provide a simple radius-coradius result for robust...

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