We call a correspondence, defined on the set of mixed strategy profiles, a generalized best reply correspondence if it has (1) a product structure, is (2) upper semi-continuous, (3) always includes a best reply to any mixed strategy profile, and is (4) convex- and closed-valued. For each...

We call a correspondence, defined on the set of mixed strategy pro les, a generalized best reply correspondence if it (1) has a product structure, (2) is upper hemi-continuous, (3) always includes a best reply to any mixed strategy pro le, and (4) is convex- and closed-valued. For each...

We call a correspondence, defined on the set of mixed strategy proles, a generalized best reply correspondence if it (1) has a product structure, (2) is upper hemi-continuous, (3) always includes a best reply to any mixed strategy prole, and (4) is convex- and closed-valued. For each generalized...

We call a correspondence, defined on the set of mixed strategy profiles, a generalized best reply correspondence if it has (1) a product structure, is (2) upper semi-continuous, (3) always includes a best reply to any mixed strategy profile, and is (4) convex- and closed-valued. For each...

We characterize the smallest faces of the polyhedron of strategy profiles that could possibly be made asymptotically stable under some reasonable deterministic dynamics. These faces are Kalai and Samet's (1984) persistent retracts and are spanned by Basu and Weibull's (1991) CURB sets based on a...

We study the design of mechanisms that implement Lindahl or Walrasian allocations and whose Nash equilibria are dynamically stable for a wide class of adaptive dynamics. We argue that supermodularity is not a desirable stability criterion in this mechanism design context, focusing instead on...

We study the design of mechanisms that implement Lindahl or Walrasian allocations and whose Nash equilibria are dynamically stable for a wide class of adaptive dynamics. We argue that supermodularity is not a desirable stability criterion in this mechanism design context, focusing instead on...

We study the design of mechanisms that implement Lindahl or Walrasian allocations and whose Nash equilibria are dynamically stable for a wide class of adaptive dynamics. We argue that supermodularity is not a desirable stability criterion in this mechanism design context, focusing instead on...

This paper analyzes a stochastic model of evolution in normal form games. The long-run behavior of individuals in this model is investigated in the limit where mutation rates tend to zero, while the expected number of mutations, and hence population sizes, tend to infinity. It is shown that...

In games with strategic substitutes (GSS), convergence of the best response dynamic starting from the inf (or sup) of the strategy space is equivalent to global stability (convergence of every adaptive dynamic to the same pure strategy Nash equilibrium). Consequently, in GSS, global stability...