Consider a family of zero-sum games indexed by a parameter that determines each player's payoff function and feasible strategies. Our first main result characterizes continuity assumptions on the payoffs and the constraint correspondence such that the equilibrium value and strategies depend...

We prove the existence of a greatest and a least interim Bayesian Nash equilibrium for supermodular games of incomplete information. There are two main differences from the earlier proofs in Vives (1990) and Milgrom and Roberts (1990): we use the interim formulation of a Bayesian game, in which...

We give variants on Berge's Maximum Theorem in which the lower and the upper semicontinuities of the preference relation are assumed for two different topologies on the action set, i.e., the set of actions availabe a priori to the decision-maker (e.g. a household with its consumption set). Two...