Standard

The Hats game. On maximum degree and diameter. / Latyshev, Aleksei; Kokhas, Konstantin.

In: Discrete Mathematics, Vol. 345, No. 7, 112868, 01.07.2022.

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

Harvard

Latyshev, A & Kokhas, K 2022, 'The Hats game. On maximum degree and diameter', Discrete Mathematics, vol. 345, no. 7, 112868. https://doi.org/10.1016/j.disc.2022.112868

APA

Latyshev, A., & Kokhas, K. (2022). The Hats game. On maximum degree and diameter. Discrete Mathematics, 345(7), [112868]. https://doi.org/10.1016/j.disc.2022.112868

Vancouver

Latyshev A, Kokhas K. The Hats game. On maximum degree and diameter. Discrete Mathematics. 2022 Jul 1;345(7). 112868. https://doi.org/10.1016/j.disc.2022.112868

Author

Latyshev, Aleksei ; Kokhas, Konstantin. / The Hats game. On maximum degree and diameter. In: Discrete Mathematics. 2022 ; Vol. 345, No. 7.

BibTeX

@article{52c40a95ec204dff802b9deb7045e422,
title = "The Hats game. On maximum degree and diameter",
abstract = "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 possible colors. Each sage can see the hat colors of his neighbors but not his own hat color. All of sages are asked to guess their own hat colors simultaneously, according to a predetermined guessing strategy and the hat colors they see, where no communication between them is allowed. The strategy is winning if it guarantees at least one correct individual guess for every assignment of colors. Given a graph G, its hat guessing number HG(G) is the maximal number k such that there exists a winning strategy. We disprove the hypothesis that HG(G)≤Δ+1 and demonstrate that diameter of graph and HG(G) are independent.",
keywords = "Deterministic strategy, Graphs, Hat guessing game, Hat guessing number",
author = "Aleksei Latyshev and Konstantin Kokhas",
note = "Publisher Copyright: {\textcopyright} 2022 Elsevier B.V.",
year = "2022",
month = jul,
day = "1",
doi = "10.1016/j.disc.2022.112868",
language = "English",
volume = "345",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "7",

}

RIS

TY - JOUR

T1 - The Hats game. On maximum degree and diameter

AU - Latyshev, Aleksei

AU - Kokhas, Konstantin

N1 - Publisher Copyright: © 2022 Elsevier B.V.

PY - 2022/7/1

Y1 - 2022/7/1

N2 - 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 possible colors. Each sage can see the hat colors of his neighbors but not his own hat color. All of sages are asked to guess their own hat colors simultaneously, according to a predetermined guessing strategy and the hat colors they see, where no communication between them is allowed. The strategy is winning if it guarantees at least one correct individual guess for every assignment of colors. Given a graph G, its hat guessing number HG(G) is the maximal number k such that there exists a winning strategy. We disprove the hypothesis that HG(G)≤Δ+1 and demonstrate that diameter of graph and HG(G) are independent.

AB - 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 possible colors. Each sage can see the hat colors of his neighbors but not his own hat color. All of sages are asked to guess their own hat colors simultaneously, according to a predetermined guessing strategy and the hat colors they see, where no communication between them is allowed. The strategy is winning if it guarantees at least one correct individual guess for every assignment of colors. Given a graph G, its hat guessing number HG(G) is the maximal number k such that there exists a winning strategy. We disprove the hypothesis that HG(G)≤Δ+1 and demonstrate that diameter of graph and HG(G) are independent.

KW - Deterministic strategy

KW - Graphs

KW - Hat guessing game

KW - Hat guessing number

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

UR - https://www.mendeley.com/catalogue/d8ed9807-536e-35a6-b6ec-cd5c8ece8c5e/

U2 - 10.1016/j.disc.2022.112868

DO - 10.1016/j.disc.2022.112868

M3 - Article

AN - SCOPUS:85125737127

VL - 345

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 7

M1 - 112868

ER -

ID: 98395538