We present two examples of discounted stochastic games, each with a continuum of states, finitely many players, and actions, that possess no stationary equilibria. The first example has deterministic transitions—an assumption undertaken in most of the early applications of dynamics games in economics—and perfect information, and does not possess even stationary approximate equilibria or Markovian equilibria. The second example satisfies, in addition to stronger regularity assumptions, that all transitions are absolutely continuous with respect to a fixed measure—an assumption that has been widely used in more recent economic applications. This assumption has been undertaken in several positive results on the existence of stationary equilibria in special cases, and in particular, guarantees the existence of stationary approximate equilibria.

A general selection theorem is presented constructing a measurable mapping from a state space to a parameter space under the assumption that the state space can be decomposed as a collection of countable equivalence classes under a smooth equivalence relation. It is then shown how this selection theorem can be used as a general purpose tool for proving the existence of measurable equilibria in broad classes of several branches of games when an appropriate smoothness condition holds, including Bayesian games with atomic knowledge spaces, stochastic games with countable orbits, and graphical games of countable degree—examples of a subclass of games with uncountable state spaces that we term purely atomic games. Applications to repeated games with symmetric incomplete information and acceptable bets are also presented.