On more variants of the Majority Problem
On more variants of the Majority Problem
The problem we are considering is the following. A colorblind player is given a set $B = \{b_1,b_2,...,b_N\}$ of $N$ colored balls. He knows that each ball is colored either red or green, and that there are less green balls (this will be called a Red-green coloring), but he cannot …