Abstract: Kenneth May in 1952 proved a classical theorem characterizing simple majority rule for two alternatives. Surprising recent work has employed this type of axiomatic approach for page ranking systems in search engines, and ensemble learning algorithms, for example. I will give a generalization of May's theorem to the case of three alternatives, but where the voters' preference relations are required to be trees with alternatives at the leaves.