We show that, in repeated common interest games without discounting, strong `perturbation implies efficiency' results require that the perturbations must include strategies which are `draconian' in the sense that they are prepared to punish to the maximum extent possible. Moreover, there is a...

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

The paper analyzes the Nash equilibria of two-person discounted repeated games with one-sided incomplete information and known own payoffs. If the informed player is arbitrarily patient relative to the uninformed player, then the characterization for the informed player's payoffs is essentially...

A characteristic of many bargaining situations is that the negotiators represents the interests of a set of parties (trade unions, political parties, etc.) with composite interests, whose bargaining behaviour is regulated by some collective decision mechanism. In this paper we provide a natural...

Modica and Rustichini [Theory and Decision 37, 1994] provided a logic for reasoning about knowledge where agents may be unaware of certain propositions. However, their original approach had the unpleasant property that nontrivial unawareness was incompatible with partitional information...

Aumann has proved that common knowledge of substantive rationality implies the backwards induction solution in games of perfect information. Stalnaker has proved that it does not. Roughly speaking, a player is substantively rational if, for all vertices $v$, if the player were to reach vertex...

Given a finite game with common payoffs (i.e. the players have completely common interests), we show that the problem of determining whether there exists a joint strategy where each player nets at least k is NP-complete.

A notion of cognitive uncertainty is introduced as an agent's uncertainty about the validity of the results of his own information processing. In order to analyze this notion, a formal model of the agent's information processing is presented. It is shown how cognitive uncertainty may prevent a...

Logical characterizations of the common prior assumption (CPA) are investigated. Two approaches are considered. The first is called frame distinguishability and is similar in spirit to the approaches considered in the economics literature. Results similar to those obtained in the economics...

(less than 25 lines) I prove the subgame-perfect equivalent of the basic result for Nash equilibria in normal-form games of strategic complements: the set of subgame-perfect equilibria is a non-empty, complete lattice. For this purpose I introduce a device that allows the study of the set of...