Geodesic
Cliques and constructors in “Hats” game. I
Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part XI, Tome 488 (2019), pp. 66-96 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice du chapitre de livre

We analyze the following general variant of deterministic “Hats” game. Several sages wearing colored hats occupy the vertices of a graph, $k$-th sage can have hats of one of $h(k)$ colors. 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. A predetermined guessing strategy is winning if it guarantees at least one correct individual guess for every assignment of colors. For complete graphs and for cycles we solve the problem of describing fuctions $h(k)$ for which the sages win. We develop “theory of construcors”, that is a collection of theorems demonstrating how one can construct new graphs for which the sages win. We define also new game “Check by rook” which is equivalent to Hats game on $4$-cycle and give complete analysis of this game. 
@article{ZNSL_2019_488_a3,
     author = {K. P. Kokhas and A. S. Latyshev},
     title = {Cliques and constructors in {{\textquotedblleft}Hats{\textquotedblright}} {game.~I}},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {66--96},
     year = {2019},
     volume = {488},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2019_488_a3/}
}
TY  - JOUR
AU  - K. P. Kokhas
AU  - A. S. Latyshev
TI  - Cliques and constructors in “Hats” game. I
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2019
SP  - 66
EP  - 96
VL  - 488
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2019_488_a3/
LA  - ru
ID  - ZNSL_2019_488_a3
ER  - 
%0 Journal Article
%A K. P. Kokhas
%A A. S. Latyshev
%T Cliques and constructors in “Hats” game. I
%J Zapiski Nauchnykh Seminarov POMI
%D 2019
%P 66-96
%V 488
%U http://geodesic.mathdoc.fr/item/ZNSL_2019_488_a3/
%G ru
%F ZNSL_2019_488_a3
K. P. Kokhas; A. S. Latyshev. Cliques and constructors in “Hats” game. I. Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part XI, Tome 488 (2019), pp. 66-96. http://geodesic.mathdoc.fr/item/ZNSL_2019_488_a3/

[1] S. Butler et al., “Hat guessing games”, SIAM review, 51 (2009), 399–413 | DOI | MR | Zbl

[2] M. Gadouleau, N. Georgiou, “New constructions and bounds for Winkler's Hat Game”, SIAM J. Discrete Math., 29:2 (2015), 823–834 | DOI | MR | Zbl

[3] M. Gadouleau, “Finite dynamical systems, Hat Games, and coding theory”, SIAM J. Discrete Math., 32:3 (2018), 1922–1945 | DOI | MR | Zbl

[4] W. W. Szczechla, “The three colour hat guessing game on cycle graphs”, The Electronic Journal of Combinatorics, 26 (2017) | MR

[5] M. Farnik, A hat guessing game, PhD thesis, Jagiellonian University, 2015

[6] N. Alon et al., The hat guessing number of graphs, 2018, arXiv: 1812.09752

[7] B. Bosek et al., Hat chromatic number of graphs, 2019, arXiv: abs/1905.04108v1

[8] K. P. Kokhas, A. S. Latyshev, “Na kakikh grafakh mudretsy mogut ugadat tsvet khotya by odnoi shlyapy”, Zap. nauchn. semin. POMI, 464, 2017

[9] M. Krzywkowski, “On the hat problem, its variations, and their applications”, Annales Universitatis Paedagogicae Cracoviensis Studia Mathematica, 9:1 (2010) | MR | Zbl

[10] K. Soundararajan, Approximating 1 from below using $n$ Egyptian fractions, 2005, arXiv: math/0502247v1

[11] S. L. Berlov i dr., Zadachi Sankt-Peterburgskoi olimpiady shkolnikov po matematike 2016 goda, MTsNMO, M., 2017