We study games in which the choices available to players are not fixed, and may change during the course of play. Specifically, we consider a model in which players may switch strategies, and a global (social) decision may remove some choices, based on the strategies being adopted by players. We propose a logical formalism in which such choices are specified, and a model of bounded memory strategies in which the eventual implications of such choices can be computed, and present preliminary results.