Motivated by questions in Social Choice Theory I will consider
the following extremal problem in Combinatorial Geometry. Call a
sequence of vectors of length n with −1, 1 entries feasible if it
contains a subset whose sum is positive in more than n...