On the set coincidence game
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.
- scientific article; zbMATH DE number 3839974 (Why is no real title available?)
- scientific article; zbMATH DE number 3877237 (Why is no real title available?)
- scientific article; zbMATH DE number 3900800 (Why is no real title available?)
- scientific article; zbMATH DE number 3974960 (Why is no real title available?)
- scientific article; zbMATH DE number 4035609 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3539030 (Why is no real title available?)
- On Ringeisen's isolation game
- The set coincidence game: Complexity, attainability, and symmetric strategies
- Variations on a game
This page was built for publication: On the set coincidence game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2641236)