We consider voting games induced by anonymous and top-unanimous social choice functions. The class of such social choice functions is quite broad, including every “t-refinement” of the Plurality Rule, Plurality with a Runoff, the Majoritarian Compromise and the Single Transferable Vote,...

It is shown that the Majoritarian Compromise of Sertel (1986) is subgame-perfect implementable on the domain of strict preference profiles, although it fails to be Maskin-monotonic and is hence not implementable in Nash equilibrium. The Majoritarian Compromise is Pareto-optimal and obeys SNIP...