Abstract
For ƒ an anonymous exactly strongly consistent social choice function (ESC SCF) and x an alternative, define b x=b( f) x to be the size of a minimal blocking coalition for x. By studying the correspondence between ƒ and {b( f) x} , we establish the existence, uniqueness and monotonicity of ESC SCF's. We also prove the following conjecture of B. Peleg: A non–constant anonymous ESC SCF depends on the knowledge of every player's full preference profile.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
