Supermodular Games: Theory and Applications

This talk will introduce the basic class of supermodular games and the main general results of this theory. The topics include existence and order structure of pure-strategy Nash equilibria, iterated elimination of dominated strategies, convergence of learning algorithms, some coalitional equilibrium concepts, mechanism design, comparative statics of equilibria for supermodular games, and a number of economic applications. New results on the comparative statics of Nash equilibria (even for non-supermodular games) will be presented via a method based on properties of supermodular games.