A solution to the Box Game (Q1095050): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Biased Positional Games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Solution of the Shannon Switching Game / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:26, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A solution to the Box Game |
scientific article |
Statements
A solution to the Box Game (English)
0 references
1987
0 references
The authors give a complete solution to the Box Game introduced by \textit{V. Chvátal} and \textit{P. Erdős} [Ann. Discrete Math. 2, 221-229 (1978; Zbl 0374.90086)]. This is a two player game played on n pairwise disjoint nonempty sets \(A_ 1,...,A_ n\). At each of their moves the players, called the Maker and the Breaker, claim at most q resp. p elements from the sets. The objective of the Maker is to claim all elements from one of the \(A_ i's\), while the objective of the Breaker is to prevent him to succeed.
0 references
Shannon switching game
0 references
Box Game
0 references