Citation:
Peleg, Bezalel . “Consistent Voting Systems Revisited: Computation And Axiomatic Characterization”. Discussion Papers 2013. Web.
Abstract:
We add two results to the theory of consistent voting. Let M be the set of all survivors of some feasible elimination procedure. We prove that i) M can be computed in polynomial time for each profile of preferences and ii) M is characterized by anonymity, non- imposition, Maskin monotonicity, and additive blocking.