Skip to main content
SpringerLink
Log in

Cliques and Constructors in “Hats” Game. II

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

The following general variant of deterministic “Hats” game is analyzed. Several sages wearing colored hats occupy the vertices of a graph, the kth 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 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. Winning strategies for the sages on complete graphs are demonstrated, and the Hats games on almost complete graphs are analyzed. Several theorems demonstrating how one can construct new graphs for which the sages win are proved.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Butler, M T. Hajiaghayi, R. D. Kleinberg, and T. Leighton, “Hat guessing games,” SIAM Review, 51, 399–413 (2009).

    Article  MathSciNet  Google Scholar 

  2. M. Gadouleau and N. Georgiou, “New constructions and bounds for winkler’s hat game,” SIAM J. Discrete Math., 29, 823–834 (2015).

    Article  MathSciNet  Google Scholar 

  3. M. Gadouleau, “Finite dynamical systems, hat games, and coding theory,” SIAM J. Discrete Math., 32, No. 3, 1922–1945 (2018).

    Article  MathSciNet  Google Scholar 

  4. W. W. Szczechla, “The three colour hat guessing game on cycle graphs,” Electronic J. Combin., 26, P1.37 (2017).

    Article  MathSciNet  Google Scholar 

  5. M. Farnik, A Hat Guessing Game, Jagellonian University (2015).

  6. N. Alon, O. Ben-Eliezer, C. Shangguan, and I. Tamo, “The hat guessing number of graphs,” arXiv:1812.09752 (2018).

  7. B. Bosek, A. Dudek, M. Farnik, J. Grytczuk, and P. Mazur, “Hat Chromatic Number of Graphs,” arXiv:1905.04108v1 (2019).

  8. R. P. Kokhas and A. S. Latyshev, “For which graphs sages can guess a color of at least one hat,” Zap. Nauchn. Semin. POMI, 464, 48–76 (2017).

    MATH  Google Scholar 

  9. R. P. Kokhas and A. S. Latyshev, “Cliques an constructors in “Hats” game, I,” Zap. Nauchn. Semin. POMI, (2021), this volume.

Download references

Author information

Authors and Affiliations

  1. St.Petersburg State University, St.Petersburg, Russia

    K. P. Kokhas

  2. ITMO University, St.Petersburg, Russia

    A. S. Latyshev

  3. National Research Institute “Higher School of Economics,”, St.Petersburg, Russia

    V. I. Retinskiy

Authors
  1. K. P. Kokhas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. S. Latyshev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. I. Retinskiy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to K. P. Kokhas.

Additional information

Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 488, 2019, pp. 97–118.

Translated by the authors.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kokhas, K.P., Latyshev, A.S. & Retinskiy, V.I. Cliques and Constructors in “Hats” Game. II. J Math Sci 255, 58–70 (2021). https://doi.org/10.1007/s10958-021-05349-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-021-05349-8

Search

Navigation