@booklet {peleg-cvsrcaac2013,
	title = {Consistent Voting Systems Revisited: Computation and Axiomatic Characterization},
	howpublished = {Discussion Papers},
	year = {2013},
	month = {10},
	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.},
	url = {/files/dp649.pdf},
	author = {Bezalel Peleg}
}
