This paper provides a definition of epistemic stability of sets of strategy profiles, and uses it to characterize variants of curb sets in finite games, including the set of rationalizable strategies and minimal curb sets.

This paper yields sufficient conditions for Pareto inoptimality of controls forming Nash equilibria in differential games. In Appendix a result on existence of open loop Nash equilibria is added.

This paper presents an analytically tractable dynamic game in which players jointly use a resource. The resource replenishes fully but collapses should total use exceed a threshold in any one period. The initial level of use is known to be safe. If it is at all optimal to increase resource use,...

Consider a contract between two players, describing the payment an agent obtains from the principal, in exchange for a good or service supplied. At each point in time, either player may unilaterally demand a renegotiation of the contract, involving renegotiation costs for both players....

In a contest with positional dynamics between an incumbent and a challenger i) inequality of power may magnify conflicts, ii) more severe conflicts can go together with lower turnover of incumbents, and iii) power can be self defeating as cost advantages can reduce pay-offs. These three...

We develop a model of credit rating agencies (CRAs) based on reputation concerns. Ratings a ffect investors' choice and, thereby, also issuers' access to funding and default risk. We show that in equilibrium - the informational content of credit ratings is inferior to that of CRAs' private...

Proper consistency is defined by the properties that each player takes all opponent strategies into account (is cautious) and deems one opponent strategy to be infinitely more likely than another if the opponent prefers the one to the other (respects preferences). When there is common certain...

We justify the application to extensive games of the concept of ‘fully permissible sets’, which corresponds to choice sets when there is common certain belief of the event that each player prefer one strategy to another if and only if the former weakly dominates the latter on the set of all...

The concept of ‘fully permissible sets’ is defined by an algorithm that eliminates strategy subsets. It is characterized as choice sets when there is common certain belief of the event that each player prefer one strategy to another if and only if the former weakly dominates the latter on...

I characterize backward induction in an epistemic model of perfect information games where players have common certain belief of the consistency of preferences rather than the rationality of choice. In this approach, backward induction corresponds to common certain belief of ‘belief in each...