Zapiski Nauchnykh Seminarov POMI
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Zapiski Nauchnykh Seminarov POMI, 2017, Volume 464, Pages 48–76 (Mi znsl6521)  
This article is cited in 7 scientific papers (total in 7 papers)

For which graphs sages can guess a color of at least one hat

K. Kokhasa, A. Latyshevb

a St. Petersburg State University, St. Petersburg, Russia
b Information Technologies and Programming Faculty, St. Petersburg National Research University of Information Technologies, Mechanics and Optics, St. Petersburg, Russia
Full-text PDF (297 kB) Citations (7)
References:
PDF
HTML
Abstract: Several sages wearing coloured hats are situated at the vertices of a graph. Each sage tries to guess his own hat colour merely on the basis of observing the hats worn by their neighbours without exchanging the information. Each hat can have one of three colours. A predetermined guessing strategy is winning if it guarantees at least one correct individual guess for every assignment of colours. We completely solve the question for which graphs the sages win.
Key words and phrases: game, graph, deterministic strategy, information.
Received: 16.11.2017
English version:
Journal of Mathematical Sciences (New York), 2019, Volume 236, Issue 5, Pages 503–520
DOI: https://doi.org/10.1007/s10958-018-4128-y
Document Type: Article
UDC: 519.17+519.83
Language: Russian
Citation: K. Kokhas, A. Latyshev, “For which graphs sages can guess a color of at least one hat”, Combinatorics and graph theory. Part IX, Zap. Nauchn. Sem. POMI, 464, POMI, St. Petersburg, 2017, 48–76; J. Math. Sci. (N. Y.), 236:5 (2019), 503–520
Citation in format AMSBIB
\Bibitem{KokLat17}
\by K.~Kokhas, A.~Latyshev
\paper For which graphs sages can guess a~color of at least one hat
\inbook Combinatorics and graph theory. Part~IX
\serial Zap. Nauchn. Sem. POMI
\yr 2017
\vol 464
\pages 48--76
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl6521}
\transl
\jour J. Math. Sci. (N. Y.)
\yr 2019
\vol 236
\issue 5
\pages 503--520
\crossref{https://doi.org/10.1007/s10958-018-4128-y}
Linking options:
  • https://www.mathnet.ru/eng/znsl6521
  • https://www.mathnet.ru/eng/znsl/v464/p48
    • This publication is cited in the following 7 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:227
    Full-text PDF :88
    References:38
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024