Voting in Collective Stopping Games

At each moment in time, some alternative from a finite set is selected by a dynamic process. Players observe the alternative selected and sequentially cast a yes or a no vote. If the set of players casting a yes–vote is decisive for the alternative in question, the alternative is accepted and the game ends. Otherwise the next period begins. We refer to this class of problems as collective stopping problems. Collective choice games, quitting games, and coalition formation games are particular examples that fit nicely into this more general framework. When the core of this game is non–empty, a stationary equilibrium in pure strate-gies is shown to exist. But in general, even mixed stationary equilibria may not exist in collective stopping games. We consider strategies that are pure and action– independent, and allow for a limited degree of history dependence. Under such indi-vidual behavior, aggregate behavior can be conveniently summarized by a collective strategy. We consider collective strategies that are simple and induced by two–step game–plans and provide a constructive proof that this collection always contains a subgame perfect equilibrium. The existence of such an equilibrium is shown to imply the existence of a sequential equilibrium in an extended model with incomplete infor-mation. Collective equilibria are shown to be robust to perturbations in the dynamic process and in utilities. We apply our approach to the case with three alternatives exhibiting a Condorcet cycle and to the Baron-Ferejohn model of redistributive pol-itics