Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Kokhas, Konstantin"'
Autor:
Latyshev, Aleksei, Kokhas, Konstantin
We analyze the version of the deterministic Hats game. In this paper, we present new constructors, i.e. theorems that allow built winning strategies for the sages on different graphs. Using this technique we calculate the hat guessing number ${\text{
Externí odkaz:
http://arxiv.org/abs/2301.10305
Autor:
Latyshev, Aleksei, Kokhas, Konstantin
We analyze the following version of the deterministic \hats game. We have a graph $G$, and a sage resides at each vertex of $G$. When the game starts, an adversary puts on the head of each sage a hat of a color arbitrarily chosen from a set of $k$ po
Externí odkaz:
http://arxiv.org/abs/2108.08065
Autor:
Latyshev, Aleksei, Kokhas, Konstantin
We analyze the following general version of the deterministic Hats game. Several sages wearing colored hats occupy the vertices of a graph. Each sage can have a hat of one of $k$ colors. Each sage tries to guess the color of his own hat merely on the
Externí odkaz:
http://arxiv.org/abs/2102.07138
Autor:
Latyshev, Aleksei, Kokhas, Konstantin
Publikováno v:
In Discrete Mathematics March 2024 347(3)
The following general variant of deterministic Hats game is analyzed. Several sages wearing colored hats occupy the vertices of a graph, the $k$-th sage can have hats of one of $h(k)$ colors. Each sage tries to guess the color of his own hat merely o
Externí odkaz:
http://arxiv.org/abs/2004.09605
Autor:
Kokhas, Konstantin, Latyshev, Aleksei
Publikováno v:
Journal of Mathematical Sciences, 2019, Volume 236, Issue 5, pp 503-520
Several sages wearing colored hats occupy the vertices of a graph. Each sage tries to guess the color of his own hat merely on the basis of observing the hats of his neighbours without exchanging any information. Each hat can have one of three colors
Externí odkaz:
http://arxiv.org/abs/1901.07248
Autor:
Latyshev, Aleksei, Kokhas, Konstantin
Publikováno v:
In Discrete Mathematics July 2022 345(7)
Autor:
Kokhas Konstantin, Aleksei Latyshev
Publikováno v:
Discrete Mathematics. 345:112868
We analyze the following version of the deterministic \hats game. We have a graph $G$, and a sage resides at each vertex of $G$. When the game starts, an adversary puts on the head of each sage a hat of a color arbitrarily chosen from a set of $k$ po
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a22907748e9f3f7a4cee526b48d76a40
https://doi.org/10.1016/j.disc.2022.112868
https://doi.org/10.1016/j.disc.2022.112868