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

Individuals and two-person teams play a hidden - action trust game with pre - play communication. We replicate previous results for individuals that non-binding promises increase cooperation rates. But this does not extend to teams. Wh ile teams make non-binding promises to cooperate at the same...

This paper studies fictitious play in networks of noncooperative two-person games. We show that continuous-time fictitious play converges to the set of Nash equilibria if the overall n-person game is zero-sum. Moreover, the rate of convergence is 1/T, regardless of the size of the network. In...

We define a cautious version of extensive-form rationalizability for generalized extensive- form games with unawareness that we call prudent rationalizability. It is an extensive-form analogue of iterated admissibility. In each round of the procedure, for each tree and each information set of a...

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