arXiv subjects
Publications and source records attributed to Artur Poplawski.
Paper develops axiomatic characterization of the family of majority vote rules in the way alternative to characterization of the majority vote given in paper of Kenneth O. May in the 1952. This, similar but different, axiomatics focuses on the consistency of the voting procedure. Both approaches are compared. Relation to famous Kenneth J. Arrow's Impossibility Theorem is also discussed.
The sufficient condition for partial function from the cartesian square of the finite set to the reals to be compatible with some metric on this set is given. It is then shown, that when afforementioned set and function are respectively a space of binary words of length n and probalities of receiving some word after sending the other word through Binary Assymetric Channel the condition is satisfied so the required metrics exist.