Displaying similar documents to “On two combination rules for 0-1-sequences.”

On three-rowed chomp.

Brouwer, Andries E., Horváth, Gábor, Molnár-Sáska, Ildikó, Szabó, Csaba (2005)

Integers

Similarity:

Blocking Wythoff Nim.

Larsson, Urban (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Yet another hat game.

Paterson, Maura B., Stinson, Douglas R. (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Random priority two-person full-information best choice problem with imperfect observation

Zdzisław Porosiński, Krzysztof Szajowski (2000)

Applicationes Mathematicae

Similarity:

The following version of the two-player best choice problem is considered. Two players observe a sequence of i.i.d. random variables with a known continuous distribution. The random variables cannot be perfectly observed. Each time a random variable is sampled, the sampler is only informed whether it is greater than or less than some level specified by him. The aim of the players is to choose the best observation in the sequence (the maximal one). Each player can accept at most one realization...

Two pile move-size dynamic Nim.

Holshouser, Arthur, Reiter, Harold (2005)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Similarity: