Hats: all or nothing

01/04/2018
by   Theo van Uem, et al.
0

N distinguishable players are randomly fitted with a white or black hat, where the probabilities of getting a white or black hat may be different, but known and the same to all the players. All players guess simultaneously the color of their own hat observing only the hat colors of the other N-1 players. The team wins if all players guess right. No communication of any sort is allowed, except for an initial strategy session before the game begins. Our goal is to maximize the probability of winning the game and to describe optimal strategies.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/26/2020

INFLUENCE: a partizan scoring game on graphs

We introduce the game INFLUENCE, a scoring combinatorial game, played on...
research
06/08/2023

Generalized four person hat game

This paper studies Ebert's hat problem with four players and two colors,...
research
08/28/2023

Entropy-Based Strategies for Multi-Bracket Pools

Much work in the March Madness literature has discussed how to estimate ...
research
02/05/2020

Stimulating Creativity with FunLines: A Case Study of Humor Generation in Headlines

Building datasets of creative text, such as humor, is quite challenging....
research
12/15/2019

Utilizing Players' Playtime Records for Churn Prediction: Mining Playtime Regularity

In the free online game industry, churn prediction is an important resea...
research
09/06/2019

NP-completeness of the game Kingdomino

Kingdomino is a board game designed by Bruno Cathala and edited by Blue ...

Please sign up or login with your details

Forgot password? Click here to reset