A combinatorial approach to Ebert's hat game with many colors

MaRDI QIDQ470962zbMATHFDO

Authors Uthaipon Tantipongpipat

Publication date 13 November 2014

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i4p33

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

gameEbert's hat gamegeneralized coverhat gamestrong covering

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Cooperative games (91A12) Combinatorial aspects of packing and covering (05B40) Combinatorial games (91A46)

Recommendations

• Yet another hat game
• A more colorful hat problem
• On optimal strategies for a hat game on graphs
• New constructions and bounds for Winkler's hat game
• On Levine’s notorious hat puzzle

Cites work

• scientific article; zbMATH DE number 5196688 (Why is no real title available?)
• Problems and results in extremal combinatorics. II
• Yet another hat game

Cited in

(7)

• Covering codes for Hats-on-a-line
• A more colorful hat problem
• A Dutch book for group decision-making?
• On Levine's notorious hat puzzle
• Hat problem: a new strategy based on quantum stabilizer codes
• Yet another hat game
• Strategic equivalence among hat puzzles of various protocols with many colors

This page was built for publication: A combinatorial approach to Ebert's hat game with many colors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q470962)