Standard

The Hats Game. the Power of Constructors. / Kokhas, K. P.; Latyshev, A.

In: Journal of Mathematical Sciences (United States), Vol. 255, No. 2, 05.2021, p. 124-131.

Research output: Contribution to journal › Article › peer-review

Harvard

Kokhas, KP & Latyshev, A 2021, 'The Hats Game. the Power of Constructors', Journal of Mathematical Sciences (United States), vol. 255, no. 2, pp. 124-131. https://doi.org/10.1007/s10958-021-05355-w

APA

Kokhas, K. P., & Latyshev, A. (2021). The Hats Game. the Power of Constructors. Journal of Mathematical Sciences (United States), 255(2), 124-131. https://doi.org/10.1007/s10958-021-05355-w

Vancouver

Kokhas KP, Latyshev A. The Hats Game. the Power of Constructors. Journal of Mathematical Sciences (United States). 2021 May;255(2):124-131. https://doi.org/10.1007/s10958-021-05355-w

Author

Kokhas, K. P. ; Latyshev, A. / The Hats Game. the Power of Constructors. In: Journal of Mathematical Sciences (United States). 2021 ; Vol. 255, No. 2. pp. 124-131.

BibTeX

@article{690504f7daa4450cb80208d4ec83749a,
title = "The Hats Game. the Power of Constructors",
abstract = "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 basis of observing the hats of his neighbors without exchanging any information. A predetermined guessing strategy is winning if it guarantees at least one correct individual guess for every assignment of colors. We present an example of a planar graph for which the sages win for k = 14. We also give an easy proof of the theorem about the Hats game on “windmill” graphs.",
author = "Kokhas, {K. P.} and A. Latyshev",
note = "Publisher Copyright: {\textcopyright} 2021, Springer Science+Business Media, LLC, part of Springer Nature.",
year = "2021",
month = may,
doi = "10.1007/s10958-021-05355-w",
language = "English",
volume = "255",
pages = "124--131",
journal = "Journal of Mathematical Sciences",
issn = "1072-3374",
publisher = "Springer Nature",
number = "2",

}

RIS

TY - JOUR

T1 - The Hats Game. the Power of Constructors

AU - Kokhas, K. P.

AU - Latyshev, A.

N1 - Publisher Copyright: © 2021, Springer Science+Business Media, LLC, part of Springer Nature.

PY - 2021/5

Y1 - 2021/5

N2 - 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 basis of observing the hats of his neighbors without exchanging any information. A predetermined guessing strategy is winning if it guarantees at least one correct individual guess for every assignment of colors. We present an example of a planar graph for which the sages win for k = 14. We also give an easy proof of the theorem about the Hats game on “windmill” graphs.

AB - 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 basis of observing the hats of his neighbors without exchanging any information. A predetermined guessing strategy is winning if it guarantees at least one correct individual guess for every assignment of colors. We present an example of a planar graph for which the sages win for k = 14. We also give an easy proof of the theorem about the Hats game on “windmill” graphs.

UR - http://www.scopus.com/inward/record.url?scp=85104697466&partnerID=8YFLogxK

UR - https://www.mendeley.com/catalogue/e64b51bd-09e5-3991-a8e3-1ec5c9551eb3/

U2 - 10.1007/s10958-021-05355-w

DO - 10.1007/s10958-021-05355-w

M3 - Article

AN - SCOPUS:85104697466

VL - 255

SP - 124

EP - 131

JO - Journal of Mathematical Sciences

JF - Journal of Mathematical Sciences

SN - 1072-3374

IS - 2

ER -

ID: 86150356