Cliques and constructors in ``Hats'' game. II
type: Item
instance of: scholarly article
title: Cliques and constructors in ``Hats'' game. II
zbMATH Open document ID: 1466.91056
author: K. Kokhas'
author: A. S. Latyshev
author: V. I. Retinskiy
published in: Journal of Mathematical Sciences (New York)
publication date: 2021-05-26T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 05C57
zbMATH DE Number: 7351189
MaRDI profile type: Publication
full work available at URL: s10958-021-05349-8
OpenAlex ID: W4239182639
cites work: Hat Guessing Games
cites work: New Constructions and Bounds for Winkler's Hat Game
cites work: Finite Dynamical Systems, Hat Games, and Coding Theory
cites work: The three colour hat guessing game on cycle graphs
cites work: The hat guessing number of graphs
cites work: For which graphs the sages can guess correctly the color of at least one hat
DOI: 10.1007/S10958-021-05349-8
Recommended article: Cliques and constructors in ``Hats'' game. I
Recommended article: Clique-Width and Parity Games
Recommended article: New Constructions and Bounds for Winkler's Hat Game
Recommended article: On the clique-game
Recommended article: A threshold for the maker-breaker clique game
Recommended article: Q5419989
Recommended article: On Optimal Strategies for a Hat Game on Graphs
Recommended article: Clique games: a family of games with coincidence between the nucleolus and the Shapley value
Recommended article: The Hats game. The power of constructors
description: scientific article; zbMATH DE number 7351189