A Comparison of NTU Values in a Cooperative Game with Incomplete Information

2018 ◽  
Author(s):  
Andrés Eduardo Salamanca Lugo
Keyword(s):  
Incomplete Information ◽  
Cooperative Game

scholarly journals The Three Colour Hat Guessing Game on Cycle Graphs

10.37236/5135 ◽  
2017 ◽  
Vol 24 (1) ◽  
Author(s):  
Witold Szczechla
Keyword(s):  
Incomplete Information ◽  
Cooperative Game ◽  
Winning Strategy ◽  
Relational System ◽  
Asymmetric Game ◽  
Cycle Graph

We study a cooperative game in which each member of a team of N players, wearing coloured hats and situated at the vertices of the cycle graph with N vertices, is guessing their own hat colour merely on the basis of observing the hats worn by their two 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 prove that a winning strategy exists if and only if N is divisible by 3 or N = 4. This asymmetric game is an example of relational system using incomplete information about an unpredictable situation, where at least one participant has to act properly.

Averaging of temporal memories under conditions of incomplete information

2011 ◽  
Author(s):  
Joseph Leman ◽  
Matthew S. Matell ◽  
Michael Brown
Keyword(s):  
Incomplete Information
Sign in / Sign up

Export Citation Format

Share Document