Noncooperative foundations of stable sets in voting games

This note investigates the noncooperative foundations of von Neumann-Morgenstern (vN-M) stable sets in voting games. To do so, we study subgame perfect equilibria of a noncooperative legislative bargaining game, based on underlying simple games. The following results emerge from such an exercise: Every stable set of the underlying simple game is the limit set of undominated pure-strategy Markov perfect equilibria, and of strategically stable sets of undominated subgame perfect equilibria of the bargaining game with farsighted voters.