An election among m ⩾ 3 candidates is conducted by system s ⊆ {1, 2, …, m −1} when each voter can vote for any k candidates so long as k ∈ s and the winner is the candidate who receives the most votes. Suppose the available data for an election conducted by s consists of the total number n of voters plus the number of votes n i received by candidate a i for i = 1, …, m, and for definiteness assume that n 1> n 2 ⩾ … ⩾ n m so that a 1 wins the election. The winner a 1 is defined to be a majority candidate if for each i > 1 more voters prefer a 1 to a i than prefer a i to a 1. Question: Given m and s, what must be true of the available election data so that the winner is certain to be a majority candidate? Assuming that a voter can have any weak preference order on the candidates but is not indifferent among all m candidates, and assuming that each voter might vote in any manner that is not clearly contrary to his own interests, the following answers to the Question are derived for m = 3 and m = 4. The only s in a three-candidate election that can guarantee that a 1 is a majority candidate is the approval voting system s = {1, 2}, and it can make this guarantee if and only if n 1 > n 2 + min{n 2, n 1 + n 2 + n 3 − n} . There are two systems for four-candidate elections that can guarantee that a 1 is a majority candidate, namely s = {1, 2} and s = {1, 2, 3}, and for each of these a 1 must be a majority candidate if and only if n 2 + n 3 + n 4 < n 2 . By implication, the plurality system s = {1} can never assure one that the winner is a majority candidate. Stronger assumptions than those used in the main analysis, which are able to ensure that the plurality winner is a majority candidate, are identified.