Searching for knights and spies: a majority/minority game
From MaRDI portal
Publication:2629287
DOI10.1016/j.disc.2016.05.007zbMath1339.05258arXiv1412.4247OpenAlexW2319167042MaRDI QIDQ2629287
Publication date: 5 July 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.4247
Network design and communication in computer systems (68M10) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (1)
Cites Work
- The majority game with an arbitrary majority
- Determining the majority
- Knights, spies, games and ballot sequences
- On computing majority by comparisons
- Variants of the majority problem.
- On a logical problem
- Optimal adaptive fault diagnosis for simple multiprocessor systems
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- Search for a majority element
This page was built for publication: Searching for knights and spies: a majority/minority game