The variant of the Majority problem we are considering is the following. A colorblind player is given a set of colored balls. He knows that each ball is colored either red or green, and that there are less green than red balls, but he cannot distinguish the two colors. For any two balls he can ask whether they are colored the same. His goal is to determine the color of each of the balls, asking as few questions as possible. In the case where there are at most (respectively exactly ) green balls, the minimum number of questions that guarantees the determination of the colors is denoted by (respectively ). We extend results of Aigner on exact values of , and we provide upper bounds for , and even exact values for the first two values of p. Our results lead to several new questions.