On the set coincidence game (Q2641236)

In the Set Coincidence Game G(V,W), two players alternately choose elements not previously chosen from a finite, nonemty set V, and W is a given family of nonempty subsets of V (the ``winning sets''). The winner is that player who first adds an element to the set of ``chosen'' elements S, so that \(S\in W\). This game is closely related to and generalizes Ringeisen's Isolation Game on graphs. We develop the theory of G(V,W), present and support a conjecture about the structure of minimal forced wins, and then prove a weakened form (the weak filter theorem). It is hoped that the indicated themes about optimal design of forced wins will prove of interest for a variety of combinatorial games.