The structure of exactly strongly consistent social choice functions

For ? an anonymous exactly strongly consistent social choice function (ESC SCF) and x an alternative, define $\text{b}{}_{\mathrm{x}}\text{=b(}{}^{\mathrm{f}}\text{)}{}_{\mathrm{x}}$ to be the size of a minimal blocking coalition for x. By studying the correspondence between ? and $\text{{b(}{}^{\mathrm{f}}\text{)}{}_{\mathrm{x}}\text{}}$, 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.