In practice, meanwhile, we sometimes must select a procedure for making social decisions without knowing for which alternatives and people it will be used. In recurring elections for some public office, for instance, there is a different slate of candidates each time, and a different population of voters, and we must use the same voting method to determine the winner, no matter who the candidates and voters are and no matter how many of them there happen to be. Such procedures are not directly available for study within Arrow’s framework, with its fixed set \(X\) of alternatives and people \(1, \ldots, n\). Arrow’s theorem is still relevant to them, though. It tells us that even when the alternatives and people are held fixed, then still there is no “good” method for deriving social orderings. Now, if there is no good method for voting even once, with the particular candidates and voters who are involved on that occasion, then nor, presumably, is there a good method that can be used repeatedly, with different candidates and voters each time.